Caml-list,<div><br></div><div>Xavier Leroy wrote</div><div>&gt; Compiling to bytecode is probably overkill.<br></div><div><br></div><div>I think that writing my own bytecode interpreter is looking for trouble. Same for compiling to an existing bytecode.</div>
<div><br></div><div>The language being a kind of SQL, most of the work is to properly execute the comprehensions (= queries).</div><div><br></div><div>For instance</div><div><br></div><div>     range numbers = 0 .. 100;</div>
<div>     {int}  sqrtLessThan [k in numbers] = { x | x in numbers : x * x &lt;= k };</div><div><br></div><div>There are smarter ways to implement this than a double loop</div><div><br></div><div>I was rather thinking of translating on-the-fly into Caml code and letting Caml do the job. Is that technically possible (rewriting a toplevel ? a CamlP4 grammar ?). If so guess I would have to license the Caml compiler from the INRIA.</div>
<div><br></div><div><br></div><div>        Diego Olivier</div>