3 ms·
If you are comfortable with translating monadic Haskell code to C for-loops[0], you may be interested in the academic line that wound up as LINQ in C#. It start
by 082349872349872 4y ago
If you are comfortable with translating monadic Haskell code to C for-loops[0], you may be interested in the academic line that wound up as LINQ in C#. It starts with Grust[1], but on the way to industry you ought to be able to find some nice papers dealing with group-by[2] and joins[3].
[0] compare how the Python VM implements list comprehensions to understand the general strategy.
[1] https://db.inf.uni-tuebingen.de/publications/2003/grust/monad-comprehensions.pdf https://db.inf.uni-tuebingen.de/publications/2003/grust/mona...
[2] the tricky part about group-by being fiddling with the bindings. cf
https://www.microsoft.com/en-us/research/wp-content/uploads/2007/09/list-comp.pdf https://www.microsoft.com/en-us/research/wp-content/uploads/...
[3] squinting enough, joins (esp. equijoins) are just really fancy zips.