Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
KenoFischer
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
31.
▲
by
KenoFischer
2y ago
Please forgive my tergiversation. I fully trust that you know your path and I know how annoying it is to be why-dont-they-just'd. As I said, I'm rooting for you.
32.
▲
by
KenoFischer
2y ago
I really love Oxide to an unhealthy amount (it's become a bit of a meme among my colleagues), but sometimes I do wonder whether they went about their go-to-market the right way. They really tried to do everything at once - custom serve
33.
▲
by
KenoFischer
2y ago
Yes. Linked press release says they borrowed equipment from NARA to play it.
34.
▲
JuliaCon 2024
(juliacon.org)
2 points
by
KenoFischer
2y ago
|
0 comments
35.
▲
by
KenoFischer
3y ago
I don't really know what kind of rebuttal you're looking for, but I will link my HN comments from when this was first posted for some thoughts: https://news.ycombinator.com/item?id=31396861#31398796 . As I said, in
36.
▲
by
KenoFischer
3y ago
Congratulations on the launch! I think it's always a great thing to have people who know what they're doing put a new design out there. Raises the bar for everyone. For example, I think the Rust folks' work on error messages
37.
▲
by
KenoFischer
4y ago
Yes, it's useful when you're ssh'd into some production system somewhere and just want to get a quick sense of some data in memory instead of going through the steps of installing a full graphics stack (which fortunately is p
38.
▲
Skip-Entry Dynamics
(aperiodic.dev)
5 points
by
KenoFischer
4y ago
|
1 comments
39.
▲
by
KenoFischer
4y ago
This is absolutely a step in the right direction. GitHub permissions are ridiculously coarse-grained. Hopefully this will lead to more fine-grained permissions on GitHub in general.
40.
▲
by
KenoFischer
4y ago
Dynamic mutliple dispatch takes into account the dynamic type rather than the static type as you would in say-C++ style function overloading. The single dispatch equivalent is function overloading vs virtual calls.
41.
▲
by
KenoFischer
4y ago
Just FYI, your 1038.pdf hyperlink at the bottom goes to the 975.pdf paper ;).
42.
▲
by
KenoFischer
4y ago
I'm not sure I really "got distracted" by building those tools. Building the tools was kind of the point for me and the class was simply a good way to focus the tools on a concrete effort. I acknowledge that it ended up occas
43.
▲
by
KenoFischer
4y ago
vchuravy's link gives the details, but basically, there's a microarchitecture optimization in Zen that breaks determinism of the performance counters. Fortunately, there's a chicken bit that turns it off, which is what the sc
44.
▲
by
KenoFischer
4y ago
> Thanks for the honest assessment. What about correctness/ composability of compiler transforms like AD, reliability of GPU acceleration and predictability of optimizations? (basically what you've discussed in some of your com
45.
▲
by
KenoFischer
4y ago
Thanks. Appreciate your thoughtful moderation as always :).
46.
▲
by
KenoFischer
4y ago
So this one is a tough one for me, because Yuri has certainly spent significant time with Julia and I think he's a very competent programmer, so his criticism is certainly to be taken seriously and I'm sad to hear he ended up with
47.
▲
by
KenoFischer
4y ago
I have a patch that teaches GDB how to do this here: https://github.com/JuliaComputing/gdb-solib-wine . Unfortunately, I don't really have the time to upstream this, but perhaps it's useful or maybe somebody s
48.
▲
by
KenoFischer
5y ago
I described what needs to happen in https://github.com/JuliaLang/julia/issues/40399 , but so far nobody has had the time to implement it.
49.
▲
by
KenoFischer
5y ago
For those who like to reminisce, here is the HN discussion from 10 years ago: https://news.ycombinator.com/item?id=3606380
50.
▲
Why We Use Julia, 10 Years Later
(julialang.org)
325 points
by
KenoFischer
5y ago
|
142 comments
51.
▲
by
KenoFischer
5y ago
LLVM has this as well now, though I believe this blog post predates the LLVM implementation and may have socialized the concept in LLVM circles.
52.
▲
by
KenoFischer
5y ago
Julia Computing | REMOTE | Full Time | juliacomputing.com Julia Computing is currently hiring for many roles, including * Cloud Engineer * EDA Core System & Compiler Engineer * Julia Application Developer * Sci
53.
▲
by
KenoFischer
5y ago
I'm assuming OP is referring to this: https://oncobites.blog/2020/07/29/modeling-aging-and-cancer-...
54.
▲
by
KenoFischer
5y ago
Mutation is tricky, because basically the only way to do it sanely is to copy all data into the residual, but since most arrays aren't actually mutated, that's extremely wasteful. I've been hoping to address this by changing
55.
▲
by
KenoFischer
5y ago
> basically the big takeaway that i walked away with was that they defined a sort of pseudoclosure in the guts of the language before the compiler which relaxes some of the behaviors of a closure (ie what gets captured) which then enable
56.
▲
by
KenoFischer
5y ago
Maaayybee ... Writing a blog post always seems like a time commitment, and I really should be doing other things ;). Somehow sequeezing in a big HN comment while I'm waiting for my builds to go through doesn't feel like the same,
57.
▲
by
KenoFischer
5y ago
Diffractor solves a couple of issues that are inter-related. I'm gonna contrast with Zygote which is the current "standard" AD in Julia and the most fancy one we have (though there are a couple other AD packages that are usef
58.
▲
by
KenoFischer
5y ago
We had a debugger like that a few years ago, but the experience was unsatisfying for people, because you got the "debugging optimized C++ code" experience with unreliable breakpoints and mostly unavailable debug variables. I took
59.
▲
by
KenoFischer
5y ago
> Like, if i write a simple pure function in Julia and call code_llvm on it… How “standalone” is the llvm code (if that is even a thing)? When does GC get called? How exactly does the generated code depend on the runtime? It's stand
60.
▲
Jump: A modeling language for mathematical optimization
(opensource.googleblog.com)
4 points
by
KenoFischer
5y ago
|
0 comments
More ›