Back to browse
GitHub Repository
59 starsRust

Prela – Purely Algebraic Relation Combinators

by remywang·Jun 1, 2026·73 points·13 comments

AI Analysis

●●SolidBig BrainNiche Gem

Tarski's relation algebra meets continuation-passing style for navigational queries.

Strengths
  • Shallow embedding means Prela operators are regular host language functions
  • Continuation-passing style compiles to efficient columnar execution
  • 163 commits across Julia, Rust, and Zig ports shows real development momentum
Weaknesses
  • Explicit research prototype warning: expect constant sweeping changes
  • Only 1 star and 11 open issues—tiny audience for algebraic relation combinators
Target Audience

Database researchers, PL enthusiasts, query language designers

Similar To

Datalog · Rel · LogicBlox

Post Description

Prela is an embedded query language based on Tarski's Algebra of Relations. Its queries are concise, clear, and fast. It is implemented by shallow embedding in a host programming language: Prela operators are regular functions in the host. The implementation follows continuation-passing style which compiles to efficient columnar execution.

Similar Projects

Developer Tools●●Solid

CocoSearch – semantic code search with syntax-aware chunking

Hybrid vector+keyword search beats single-mode retrieval, but Cursor and Cody already own this.

Solve My ProblemDark Horse
VioletCranberry
213mo ago