By the way, as I'm doing OCaml binding work, I was looking at how OCaml
could be used to design queries in a statically type safe way. I
stumbled on this:
http://eigenclass.org/hiki/addressing-orm-problem-typed-relational-algebra
How hard would it be to implement a query compiler from such a typed
relational algebra?
------------------------------------------------------------------------------
This SF.Net email is sponsored by the Verizon Developer Community
Take advantage of Verizon's best-in-class app development support
A streamlined, 14 day to market process makes app distribution fast and easy
Join now and get one step closer to millions of Verizon customers
http://p.sf.net/sfu/verizon-dev2dev
_______________________________________________
MonetDB-users mailing list
MonetDB-users@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/monetdb-users