Thank you! Prela’s `.and` operator is exactly the fork in fork algebra. I also suspect you will get `.select` and `.and` if you lift >>> and &&& to the category of Rel.
> I wonder where the limitations of this approach are seen?
Compile time. Rustc takes forever to compile, much longer than the time it takes to run the query. There’s plan to build a JIT for Prela, which would also improve the interop.
Most of the language design is orthogonal to the embedded implementation though, and Prela could very well be implemented in a vectorized engine.
> I wonder where the limitations of this approach are seen?
Compile time. Rustc takes forever to compile, much longer than the time it takes to run the query. There’s plan to build a JIT for Prela, which would also improve the interop.
Most of the language design is orthogonal to the embedded implementation though, and Prela could very well be implemented in a vectorized engine.