I've looked at APL descendants like J (jsoftware.com) and Q (kx.com),
and found Q very interesting due to its underlying in-memory database,
kdb+. It made me think of a way to experiment with it in OCaml. The
idea is that once you marry vector/list processing with very fast SQL-
like
Question: is there a way to use a camlp4 extension *inside* the
definition of another?
AFAIK, extensions are not ordered, so trying to use camlp4 to deal with
IFDEF in the source of a syntax extension (like pa_monad) to switch
between 3.10 and 3.11 [to deal with the new private and lazy
On Mon, Dec 15, 2008 at 09:04:34AM -0500, Jacques Carette wrote:
Question: is there a way to use a camlp4 extension *inside* the
definition of another?
AFAIK, extensions are not ordered, so trying to use camlp4 to deal with
IFDEF in the source of a syntax extension (like pa_monad) to
Mauricio Fernandez wrote:
I believe he's not referring to simultaneous use of pa_monad and another
extension in user code, but of Camlp4MacroParser *in* the sources of pa_monad.
That's right.
Since pa_monad is build with
ocamlc -I +camlp4 -pp camlp4orf -c pa_monad.ml
changing that to
Our apology for possible multiple copies.
--
ICTAC'09
6th International Colloquium on Theoretical Aspects of Computing
*** CALL FOR PAPERS ***
On Mon, Dec 15, 2008 at 09:04:34AM -0500, Jacques Carette wrote:
AFAIK, extensions are not ordered, so trying to use camlp4 to deal
with IFDEF in the source of a syntax extension (like pa_monad) to
switch between 3.10 and 3.11 [to deal with the new private and lazy
features] does not seem
