Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
tonyg
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
18 ms
·
211.
▲
by
tonyg
4y ago
Will, how do you think of Nota in relation to Racket's Scribble [1]? [1] https://docs.racket-lang.org/scribble/index.html
212.
▲
by
tonyg
4y ago
CL has many merits, but it does not and cannot ever have a type system like Peridot has. (If it did, it wouldn't be CL anymore.) It also does not have a logic-based metaprogramming language. Peridot's metaprogramming model is qui
213.
▲
by
tonyg
4y ago
You might enjoy this paper, which presents "stream fusion", a technique which can do what you're talking about as well as a bunch of other cool stuff: http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.
214.
▲
by
tonyg
4y ago
Oh, hey! That makes them an even more perfect analogy. They help, massively, protecting others by removing many forms of transmission; but they don't prevent all transmission. Likewise, memory safety helps, massively, protecting others
215.
▲
by
tonyg
4y ago
How so? I'm sure you take my point: that by indulging selfish wants, we can harm others. Private situations, do what you like; shared or social contexts, not so much.
216.
▲
by
tonyg
4y ago
A person's actions sometimes have effects on other people. Such as not wearing a mask, for example. Or writing some piece of obscure but critical infrastructure with a memory vulnerability that causes all someone's precious apes t
217.
▲
by
tonyg
4y ago
https://ar5iv.labs.arxiv.org/
218.
▲
by
tonyg
4y ago
Yes, absolutely! The caveats are relevant to distributed locking , though: sharding would help scale out a locking system horizontally, but each subset of keyspace would still be a non-distributed locking service. Primary-secondary replica
219.
▲
by
tonyg
4y ago
So Redis isn't really a distributed locking system. The locks are all managed by a central, non-distributed server: Redis. But this kind of lock is useful too. One nice approach to handling crashes in a system like this is to use the i
220.
▲
by
tonyg
4y ago
It's far more flexible than SML. I'd pick Racket over SML for production use any day of the week. (And I have indeed shipped code in both SML and Racket.)
221.
▲
by
tonyg
4y ago
You could try chapter 15 of TFA ( http://cs.brown.edu/courses/cs173/2012/book/types.html); otherwise, yes, TaPL is still very good. An alternative (and rather more difficult) path could be to try working
222.
▲
by
tonyg
5y ago
> [Proper tail calls are] an optimization issue for most languages It's an optimization issue for no languages; it's an optimization issue for some language implementations. At the language level, it's a resource managemen
223.
▲
by
tonyg
5y ago
Nice. Sort of a reverse FizzBuzz.
224.
▲
by
tonyg
5y ago
Right, "function-like". I thought OP was meaning the static type of a variable, which genuinely can't be known fully at runtime in general. But it turns out that they meant to write "... until runtime", not &quo
225.
▲
by
tonyg
5y ago
> One doesn't know the real type of a variable until runtime. In the program def x(f): return f(3) what is the "real type" of `f` at runtime; say, at the instant just before the call to `f`? How can you
226.
▲
by
tonyg
5y ago
> My stack is pycharm, mypy, pydantic, sqlalchemy stub, several mypy plugins, black, isort, tabNine completion, and a bunch of custom scripts/Make to automate the common tasks. Christ. What a mess. With a stack like that, it's
227.
▲
by
tonyg
5y ago
Simple rules can give surprising, complex behaviour. That's a good point. Unfortunately, it's also true not only of PEGs and recursive-descent parsing, but also of essentially every parsing formalism out there. So it doesn't
228.
▲
by
tonyg
5y ago
Well, if you wanted all odd-length strings, you'd write what GP wrote. If you wanted whatever it was your grammar accepted, you'd write what you wrote :)
229.
▲
by
tonyg
5y ago
This is a good example of a theoretical problem with PEGs. It also applies (of course) to recursive descent parsers. I don't think this problem is a practical issue, though; I can't speak for others, but this kind of problem hasn&
230.
▲
by
tonyg
5y ago
FWIW, for those coming across this thread later: There has been some research on these topics (of course). I asked the `cap-talk` list to jog my memory, and received pointers to the following interesting starting points: - "Design of t
231.
▲
by
tonyg
5y ago
Good question. You only pass it with an interaction event. (And you revoke the capability once the interaction is over.) Not perfect: stops background pasting without interaction tho. To do better, the only way I can think of right now is h
232.
▲
by
tonyg
5y ago
Indeed. Our OS security models will keep being broken until people start taking object capability design seriously ¯\_(ツ)_/¯
233.
▲
by
tonyg
5y ago
> you wouldn't be able to put a "paste" item in a context menu I don't know about that. One approach would be for the menu invocation to accept a capability object representing the active context's interpretation
234.
▲
by
tonyg
5y ago
Per RFC 8259: ws = *( %x20 / ; Space %x09 / ; Horizontal tab %x0A / ; Line feed or New line %x0D ) ; Carriage
235.
▲
by
tonyg
5y ago
Also perhaps of interest: making C faster than C by borrowing techniques from Smalltalk implementation. Piumarta, Ian, and Alessandro Warth. “Open, Extensible Object Models,” 2007. https://piumarta.com/software/cola
236.
▲
by
tonyg
5y ago
Ironically, I think following OP's prescription would yield a Smalltalk trying to be a Smalltalk without actually delivering the full experience of what it meant to use one! A kind of pyrrhic victory.
237.
▲
by
tonyg
5y ago
> He is talking about the ought I think he's wrong, both about the "is" and about the "ought". The reason I posted originally, way upthread, was to respond to OP's claim of "Smalltalk's rejection o
238.
▲
by
tonyg
5y ago
If Smalltalk is pretending to be Unix, it could just speak NFS I suppose. Or use HTTP. Or 9P. Certainly there are classes in most images that model file systems. But thinking of Smalltalk as its own thing, and coming at the angle of interop
239.
▲
by
tonyg
5y ago
IMO, Smalltalk-the-system is best thought of as an OS, yes. (Remember how everyone ridiculed the idea of Smalltalk's images right up until virtual machines became a thing?) It has a runtime and a systems programming language, too: the
240.
▲
by
tonyg
5y ago
> That's not even close to a file system Nonetheless, Smalltalk is to Unix as globals dictionary is to file system, image is to virtual machine, etc. > How do systems outside of Smalltalk get access to the Smalltalk global? How i
More ›