This page is not created by, affiliated with, or supported by Slack Technologies, Inc.
2024-05-22
Channels
- # announcements (17)
- # beginners (11)
- # biff (5)
- # calva (22)
- # cider (30)
- # clj-kondo (33)
- # clj-on-windows (20)
- # clojure (59)
- # clojure-dev (25)
- # clojure-europe (31)
- # clojure-nl (1)
- # clojure-norway (13)
- # clojure-sweden (5)
- # clojure-uk (6)
- # clojurescript (5)
- # community-development (2)
- # cursive (4)
- # datahike (5)
- # datalevin (7)
- # datomic (11)
- # emacs (8)
- # events (1)
- # gratitude (1)
- # hoplon (5)
- # hyperfiddle (1)
- # lsp (59)
- # matrix (11)
- # polylith (14)
- # portal (3)
- # practicalli (1)
- # rdf (2)
- # reitit (9)
- # releases (3)
- # rum (5)
- # yamlscript (6)
Anybody have time to read through this? https://www.w3.org/TR/rdf-canon/ Is it mostly just about digital signing? Is it worth it to read the entire thing?
Great that this has made it through to a recommendation! I’ve had a need for things like this, primarily around change detection, and as Eric Scott says creating an algebra for the purposes of versioning/history. In principle if it weren’t for blank nodes it’d be pretty easy to do. But Bnodes cause problems. I’ve not reviewed the algorithms but I suspect they require linear storage of Bnode ?s ?o triples in order to ground and hash the appropriate subtree. In practice apart from edge cases, that may not be that bad, though…
Great that this has made it through to a recommendation! I’ve had a need for things like this, primarily around change detection, and as Eric Scott says creating an algebra for the purposes of versioning/history. In principle if it weren’t for blank nodes it’d be pretty easy to do. But Bnodes cause problems. I’ve not reviewed the algorithms but I suspect they require linear storage of Bnode ?s ?o triples in order to ground and hash the appropriate subtree. In practice apart from edge cases, that may not be that bad, though…