spruceid / treeldr
☆27Updated 2 months ago
Alternatives and similar repositories for treeldr:
Users that are interested in treeldr are comparing it to the libraries listed below
- An RDF serialization format designed for performance in the browser☆31Updated 3 months ago
- RDF parsers library☆85Updated last month
- Assertions, Reduction, Collections☆17Updated 2 years ago
- Manas project aims to create a modular framework and ecosystem to create robust storage servers adhering to Solid protocol in rust.☆78Updated 5 months ago
- Rust implementation of UCAN☆64Updated 5 months ago
- Linked Data Capabilities reference implementation☆26Updated 3 months ago
- Repository for the RDF Tests Community Group☆48Updated this week
- ☆14Updated 4 years ago
- UCAN Invocation & Pipelining☆13Updated 5 months ago
- Linked Data Rendering for humans☆17Updated 2 years ago
- W3C's Notation 3 (N3) Community Group☆48Updated 8 months ago
- CG Note on JSON-LD*☆24Updated 2 months ago
- RDF Linked Data in Markdown☆30Updated 9 months ago
- RDF Dataset Canonicalization (deliverable of the RCH working group)☆13Updated 3 weeks ago
- The cryptographic signature multifomat☆11Updated 6 months ago
- An API gateway for online communities☆52Updated 7 months ago
- WORK ITEM: Authorization Capabilities (ZCAP) specification☆31Updated 2 years ago
- A TypeScript/JavaScript implementation of the RDF/JS store interface with support for quoted triples.☆13Updated 3 weeks ago
- RDF form provides rendered forms via a form definition provided in RDF turtle format.☆15Updated last year
- RDF fact prover and proof validator operating on simple conjunctive rules.☆9Updated last year
- The Linked Data Event Streams specification☆24Updated 5 months ago
- A CBOR-encoding for Linked Data.☆14Updated 2 weeks ago
- UCAN community site☆38Updated this week
- 🧩 A semantic dependency injection framework☆41Updated 2 weeks ago
- ShEx Graphic Assistant☆10Updated 2 years ago
- Rust implementation of NextGraph, a Decentralized and local-first web 3.0 ecosystem☆35Updated last week
- Hash consistent search trees.