ezyang

8 ms·

31.
by ezyang 2y ago
You can try (self promo) https://github.com/ezyang/codemcp . https://github.com/rusiaaman/wcgw is also quite popular, although they allow unrestricted shell access (that's why it's named
32.
by ezyang 2y ago
There's also some fundamental limitations to the Desktop MCP experience that are probably never getting fixed; Claude Code can spin off subagents and play around with the context, I assume that Claude Desktop's form factor is basi
33.
by ezyang 2y ago
IMO, the big problem with Aider is that it's not agentic. This is good because it means costs are down, but most of the edit-test-fix loop magic in coding agents comes from the agent loop.
34.
by ezyang 2y ago
There's a few coding MCPs out there. I have also written one (codemcp) and the pitch for mine is that it DOESN'T provide a bash tool by default and checkpoints your filesystem edits every change in Git, so that it's all abou
35.
Show HN: Codemcp – Claude Code for Claude Pro subscribers – ditch API bills(github.com)
172 points by ezyang 2y ago|36 comments
36.
by ezyang 3y ago
The llama source code in the original repo has been updated for llama 2: https://github.com/facebookresearch/llama
37.
by ezyang 4y ago
If you want to try this in Python, you can use https://github.com/ezyang/expecttest which I wrote to do expect tests in PyTorch.
38.
by ezyang 5y ago
It's especially bad for rr, since it doesn't otherwise have any reason to talk to the Internet (I see people mentioning Firefox telemetry, but you know, Firefox is a browser, you expect it to talk to the net). The best I can think
39.
PyTorch Developer Podcast(pytorch-dev-podcast.simplecast.com)
1 points by ezyang 5y ago|0 comments
40.
Rage Bug Reporting(blog.ezyang.com)
2 points by ezyang 5y ago|0 comments
41.
by ezyang 5y ago
Doesn't help when it can take several days to land! (e.g., waiting for CI.) But I will admit this is a problem that is somewhat specific to the nature of our project :)
42.
by ezyang 5y ago
I definitely miss hg’s affordances like hg next/prev and restack. It doesn’t look like, though, that git-ps lets you submit multiple patches for review, this was the raison d’etre for ghstack
43.
by ezyang 5y ago
When you amend a commit and resubmit it to the PR, ghstack translates into pushing a new commit (not force pushing) to the PR. So yesish
44.
by ezyang 5y ago
While working on PyTorch, I also wrote an equivalent tool (funnily named nearly the same thing) for doing stack diffs ( https://github.com/ezyang/ghstack/ ), which most of our team uses for more complicated PRs. Th
45.
by ezyang 9y ago
In an old draft of my post I called this out more explicitly. There are two things worth thinking about. First, if you think about actually doing this in a traditional programming language, you can quickly see that this is going to result i
46.
by ezyang 9y ago
CuPy itself is just a framework, and you could slot TC in as a thing that generates operators for it. CuPy also famously has support for inline CUDA kernels; the equivalent TC kernels are shorter and autotunable.
47.
by ezyang 9y ago
With cuDNN, some expert had to sit down and write an optimized kernel for your ops. With TC, the idea is you write the simple, tensor comprehension for your op, and then throw the autotuner at it, and get something that approaches or even b
48.
by ezyang 9y ago
Apparently they are out of stock for the i7 motherboards, so you'll have to keep an eye out if you want one of those.
49.
by ezyang 9y ago
You don't get exhaustiveness checking, which is the killer feature of variants.
50.
by ezyang 9y ago
PyTorch/ONNX dev here. ONNX is a proto2 format https://github.com/onnx/onnx/blob/master/onnx/onnx.proto -- we definitely wanted to make it easy for people to parse and load ONNX exported graph
51.
by ezyang 10y ago
Scala's type inference is not complete; it is marketed as a way to "omit certain type annotations". One of the reasons why Hindley-Milner is so influential is because you really don't need any type annotations: the inf
52.
by ezyang 10y ago
Unfortunately, it is never as easy as "just" putting in a new type system to a preexisting compiler. In the case of ML and Haskell in particular, we are kind of crazy about GADTs, and GADTs and subtyping are known to interact in c
53.
by ezyang 10y ago
It makes some things easier, but you give up principality: without things like intersection types, you end up with programs for which there isn't a "best" type to ascribe them. You can see this in the parent's example: w
54.
by ezyang 10y ago
It's a little difficult to explain why subtyping is so difficult. One answer is that Hindley-Milner inference is actually really simple; simple enough that I can ask my undergraduates to implement in a week long programming assignment.
55.
by ezyang 10y ago
The thesis is about designing a type system that supports both type inference and subtyping. If you program Java but hate writing explicit type annotations all day, the thesis offers the tantalizing possibility of having a type system that
56.
by ezyang 10y ago
The lesson of "algebra before syntax" is one that I have seen before, and it is very gratifying to see it pay off such dividends here. There is also discussion on LtU here: http://lambda-the-ultimate.org/node/
57.
by ezyang 10y ago
There are two responses here. The first is that in any language which has any sort of threading model at all, sequential code in multiple threads obviates the need for callbacks. If you block, fine; it's just a single thread, it's
58.
by ezyang 10y ago
I like to tell people that the killer app for Haskell is writing IO bound, asynchronous code. The secret weapon is do-notation, which lets you write code as if it were sequential, but have it desugar into what is (essentially) a series of c
59.
by ezyang 10y ago
Replace every occurrence of "undefined" with "non-terminating program" and the point still stands.
60.
by ezyang 10y ago
Here is a transcript of the talk: https://github.com/ezyang/cusec2012-victor/blob/master/trans...

More ›