no_identd

You might find these of interest for this topic as well: https://en.wikipedia.org/wiki/Topic_map#RDF%20relationship This could interact with the following: https://en.wikipedia.org/wiki/Semantics_of_Business_Vocabulary_and_Business_Rules The Wikipedia article about the latter one distorts what it's about...

>there exist queries expressible in Dyna that neither Hash nor HyperGraphDB can express Do you have any minimal example of such a query? Also, for an "automatically parsed except where...

Another thing perhaps mention-worthy, besides the things already mentioned here and in #11: [N-Quads](https://en.wikipedia.org/wiki/N-Triples#N-Quads), originally invented by @sbp: https://web.archive.org/web/20130707164712/http://lists.w3.org:80/Archives/Public/www-rdf-logic/2001Aug/0007.html [The mentioned-there N-Pents never manifested.] I've only found one bigger project...

The link in the reddit thread seems dead, so: https://github.com/JeffreyBenjaminBrown/rslt-haskell

>I'm floored. Are you actually using it? I admittedly half-heartedly tried a few times, but yesterday & today I tried again a lot more seriously - mostly to try to...

Unary relationships one might wish to consider for ones RLST: * `maybe _` * `not _` * `for every _` (Mentioned in the PDF, but not in the .md) *...

In case you want sortability, you'll probably want something like this to generate the UUIDs: https://docs.microsoft.com/en-us/sql/t-sql/functions/newsequentialid-transact-sql The byte shuffling & reason for it gets explained here: https://docs.microsoft.com/en-us/archive/blogs/dbrowne/how-to-generate-sequential-guids-for-sql-server-in-net

http://leoeditor.com/ seems like a good candidate for some grafting?

Nice! As for rules: I suspect one might do this very crudely and hacky at first: A fold node and an unfold node, and a folded and an unfolded node....

Speaking of file systems: http://css.csail.mit.edu/fscq/ (made by @mit-pdos)