lean-elpi
Higher-order logic programming inside Lean. Let λProlog explore the possibilities, then certify the evidence.
From connected data to certified reasoning. Explore Lean 4, knowledge graphs, and the logic that makes AI agents accountable for their answers.
Higher-order logic programming inside Lean. Let λProlog explore the possibilities, then certify the evidence.
From RDF triples to formal entailment. Semantics, search, and checked certificates for the semantic web.
Bring TypeDB’s rich relationships into Lean, with typed schemas, transactions, queries, and results.
A local graph, a typed schema, and checked Cypher. Build with LadybugDB or a pure in-memory backend.
Storage, semantics, search, and checking each have a job. Select a layer to see where it belongs.
Lean’s dependent type theory lets propositions be types and proofs be terms. The kernel checks proof terms against their claimed types, relative to the definitions and axioms used.
Learn dependent types ↗A conceptual map of responsibilities, not a single installed product. Database adapters are alternatives; connecting stored facts to proof obligations is application work.
Move from a graph that stores claims to an interface that requires evidence for the invariants you care about.
Higher-order terms make binders and relations first-class. Certificates separate finding an answer from trusting it.
RDF, RDFS, SPARQL, OWL profiles, and SHACL answer different questions. LeanRDF gives those questions explicit semantics.
Start with types and proofs. Add logic programming. Then bring the ideas to a real graph.
Find your learning path ↗