Open munael opened 2 years ago
There is a workshop paper here: https://dl.acm.org/doi/abs/10.1145/3546196.3550164
It doesn't contain deep technical details at the moment, since we have been iterating rapidly.
We're currently writing up a technical paper, so for now just keep an eye on the hazel.org webpage / follow us on twitter (neurocy / dm_0ney).
I saw a second, newer paper "Gradual Structure Editing With Obligations", but that doesn't answer the question how something like tylr could be made for other languages
Hi!
tylr
looks very interesting. I came Jack Rusher's talk at Strange Loop 2022 (https://www.youtube.com/watch?v=8Ab3ArE8W3s).Is there a technical dive somewhere into why and how it works? In terms of the algorithm and any generalizations that came from designing it, not necessarily this particular implementation.
I'm not an expert in this area, so can't reference specific terms, but I'd still be very interested in such a write-up.
Example of what I'd be looking for: How plausible would it be to design something like tylr for different existing languages? For some, more difficult than others; or maybe it needs some special grammar properties to work at all. What does that entail, etc.