2 ms·
Examples don't show much more composability comparing to SQL. Even more Prela is heavily based on tuples and has same operation semantics as SQL. Shameless plu
by bvrmn 1mo ago
Examples don't show much more composability comparing to SQL. Even more Prela is heavily based on tuples and has same operation semantics as SQL.
Shameless plug: https://github.com/baverman/sqlbind-t https://github.com/baverman/sqlbind-t
- remywang 1mo agoCompositionality is hard to show with a small example because it really only comes through at scale. If anyone can point me to a huge SQL query, I’ll take it up as a challenge to rewrite in Prela! Prela’s semantics is based on an algebra of binary relations (unfortunately called relation algebra [1]), not the standard relational algebra. [1]: https://arxiv.org/abs/2607.26356 https://arxiv.org/abs/2607.26356