Tarean

9 ms·

31.
by Tarean 5y ago
For obsidian it is a significant advantage because you can have plugins that e.g. render a markdown task lists as a Kanban board. It seems to fall into the vs-code category of being sufficiently well optimized, but if you wanted to deal wit
32.
by Tarean 5y ago
You can run your program in the repl and :set -fbreak-on-error . You can get stack traces with access to variables via :set trace, but because of optimizations and lazy evaluation they are similarly jumbled as async code debugging. Haskell
33.
by Tarean 5y ago
Inventing a new language and a new query engine and a new storage engine at the same time, competitive with the state of the art, is maybe just too much to be feasible. There were multiple optimizing compilers which can do a lot of these a
34.
by Tarean 6y ago
I think for clang that's the purpose of -fsanitize=undefined and -fsanitize=nullability. If some undefined behavior isn't caught by the sanitizer, clang doesn't use it for optimization.
35.
by Tarean 6y ago
To be fair, that's a foot gun in haskell as well. Using lists non-linearly like this in haskell gives you the correct results but at a 10x performance tax or worse because it can't optimize into a loop anymore.
36.
by Tarean 6y ago
I love powershell because I have a basic working knowledge of Linux commands. In bash this means I have to google a bit for even slightly complex things like 'change the extension of all .swp files under this directory'. In powers
37.
by Tarean 6y ago
For commands you use frequently you can still use shortforms, positional arguments, and tab completion, though. For instance in powershell you can also do: ls -r foo
38.
by Tarean 6y ago
Trying to minimize the error message as the implementor is a dangerous game because nobody else will have as much context as you. Rust error messages are widely lauded because they give context and help, not because they minimize character
39.
by Tarean 6y ago
If you show a network 10000 very similar inputs it won't learn much, and likely overfit.
40.
by Tarean 6y ago
It's an example of few-shot learning and abstraction. Show ducklings similar objects, they will prefer similar objects. Show them different objects, they will follow different objects even a cross categories. This type of learning base
41.
by Tarean 6y ago
The implementation isn't even that horrible. Ignoring the integer list. That workaround is still hillarious to me. Anyway, it seems both impressive that someone did this and that it actually works. Weird how typescript has the nicest t
42.
by Tarean 6y ago
Typeclasses are roughly equivalent to passing abstract factories around. This is enough to solve the expression problem and is known as Tagless final encoding, or object algebras in oop: interface Num<A> { A add(A l, A r
43.
by Tarean 6y ago
Apparently it takes around 1 V100 GPU hour per proof. Wonder if something like this might make it into developer tooling eventually. Writing down some nontrivial invariant like 'no deadlocks are possible' and getting the result so
44.
by Tarean 6y ago
The transformer model in GPT-3 has a short context window and no recurrence. Without some significant architecture changes that is a fundamental limit on the problems GPT-3 can solve.
45.
by Tarean 6y ago
"Knows things" is kind of vague. I'm pretty sure GPT-3 would obliterate all traditional knowledge bases we have. Even bert could achieve state of the art results when the questions are phrased as the cloze task. If you mean t
46.
by Tarean 6y ago
The data is stored as a bunch of triples but it encodes a graph. You can use tools like sparql to query that graph. https://www.stardog.com/tutorials/sparql/
47.
by Tarean 6y ago
If you pass an object into a function, the code has to work with any subclass. This means the data has to be behind a pointer since the size is unknown and method calls have to go through a vtable. If you can see the full lifetime of an obj
48.
by Tarean 6y ago
Awesome work! I still kind of wish that something RAII-like that is safe in the presence of exceptions and & types had made it in. But considering the immense amounts of work and effort that this has taken adding some more sweeping chan
49.
by Tarean 6y ago
LinearTypes guarantee that all values are used exactly once if the result is used exactly once. If an exception is thrown, the result won't be used once and the memory would leak. One cheap way is to also track the memory with the GC.
50.
by Tarean 6y ago
You need an SQL optimizer to efficiently abstract over sql. There are a couple implementations, empirically producing good sql at runtime is kinda slow. The pathfinder compiler is meant for C# linq to mix sql and XML queries. It has backe
51.
by Tarean 6y ago
There are two main parts to this: - GHC can do less unpacking (moving heap allocations to registers)because of laziness - laziness as an implementation detail is slow To implement laziness, GHC puts a closure with it's environment on t
52.
by Tarean 6y ago
Presumably it's one of these graphs? https://i.imgur.com/r7xJfi1.jpg https://lh6.googleusercontent.com/VHmmdKYio39kz017ECfPwCxGPT... There are a lot of graphs in the paper, though.
53.
by Tarean 6y ago
Data and codata are dual, but that doesn't mean they are the inverse of each other. It means we can formalize them both in category theory and they have the same formalization with reversed arrows. More usefully, data is a finite data
54.
by Tarean 7y ago
You can do `(A == B)~ False` but that won't affect type variable unification. Pretty sure `/~` would break type class coherence under haskell's open world assumption?
55.
by Tarean 7y ago
A bunch of languages have some special syntax to solve hairy problems. Async await, yield for generators, ? for dealing with errors in rust, etc. If those deal with composition and variable scoping in an intuitive way it's a monad. Th
56.
by Tarean 7y ago
Haskell is lazy, all data structures work this way unless specifically annotated otherwise. Within standard haskell 2010 it is hard to declare a linked list that doesn't work this way. It is also worth noting that haskell has library s
57.
by Tarean 7y ago
Traditionally site owners are either public or can be requested in a 7 day span by showing clear harm. Otherwise the liability falls to Namecheap. Presumably Facebooks motivation for actually suing is to prevent name registrar's from p
58.
by Tarean 8y ago
BuzzFeed and BuzzFeed News aren't really the same thing. They switched to a seperate url because a lot of people got confused. Though even if they weren't that wouldn't really invalidate the points made in the article.
59.
by Tarean 8y ago
So division by zero should be handled the same way as network timeout? Because that math code is gonna be verbose. Error codes and exceptions are both awful for control flow. Typed errors and checked exceptions work better for known errors
60.
by Tarean 8y ago
This also happened with routing messages - they are periodic and start at random offsets but they bunch up without added randomness https://ee.lbl.gov/papers/sync_94.pdf

More ›