Jason Kinzer a écrit :
I looked at the sources for these a while ago. As I recall it struck me the sql version had some extra stuff for no particularly good reason. At any rate, there are only 2 really minor differences that distinguish the two (a reflection on how well-thought out the layering in Monet is):
I'm not really qualified to comment on the layering. But the header issue in the Debian package is annoying.
Really they're quite trivial, you could easily do the same stuff in your code. The only challenging thing about that approach is going to be the make process.
Yes. It is not that difficult: the embedded_mal symbol is available, so you just need some stub code around everything... I was essentially wondering whether or not there was anything peculiar that i would have overlooked. Seems not. Thanks a lot. 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? -- Guillaume Yziquel http://yziquel.homelinux.org/