Open post Alex G @clayrat@types.pl · 6mo ago Replying to @kevin@fedi.kbg.sh <p>Doing some deep dives on structured text editing. Is anyone aware of any work on *data structures* for editing tree-like data? I’m specifically interested in stuff like multiple cursors, efficient undo/redo, etc. This is directly relevant to my research re: Telecode (which is a tree, or hedge rather), but I’ve not been able to find any papers covering data structures. Sort of unclear to me whether ropes and other usual suspects generalize well to a structured domain</p> @kevin Saw this thing a while ago, might be relevant: https://github.com/hazelgrove/tylr GitHub GitHub - hazelgrove/tylr: a tiny tile-based editor a tiny tile-based editor. Contribute to hazelgrove/tylr development by creating an account on GitHub.
Open post Alex G @clayrat@types.pl · 6mo ago Replying to @emc2@indieweb.social @lindsey@recurse.social I have actually toyed with the idea of referring to automated deduction as "structural AI", and interactive provers as something similar. @emc2@indieweb.social @lindsey@recurse.social I thought automated reasoning was always a big(gest) part of symbolic AI?
Open post Alex G @clayrat@types.pl · 6mo ago Replying to @emc2@indieweb.social @clayrat@types.pl @lindsey@recurse.social "Automated deduction" refers to something very specific, distinct from ai/ml https://cadeinc.org/ @emc2@indieweb.social @lindsey@recurse.social Yes, my point is that AI is a bigger and older field than ML. Up until about the 1990s, it was mostly about symbolic methods like SAT, first-order resolution, tableaux, etc.