Show HN: Prela – Purely Algebraic Relation Combinators
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.
28 points by remywang - 2 comments
Morel is an ML dialect that can compile set-producing expressions into bytecode that Calcite can execute against databases
Sort of like "If you could query anything with SQL but it's ML instead"
I bring this up because the example query looks very similar to Morel queries
Neat xample of solving a combinatorial optimization problem with a single query that he posted recently to Twitter:
https://x.com/i/status/2062066151841321370
http://blog.hydromatic.net/2026/06/02/package-queries.html
Not really, too many obscure symbols.
Certainly learnable but I wouldn't say immediately readable.