Show HN: Prela – Purely Algebraic Relation Combinators

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.