Browse thread
Metaprogramming features
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: | 2008-10-04 (13:22) |
From: | Jon Harrop <jonathandeanharrop@g...> |
Subject: | Re: [Caml-list] Metaprogramming features |
On Saturday 04 October 2008 10:03:58 David Teller wrote: > On Sat, 2008-10-04 at 03:00 +0100, Jon Harrop wrote: > > 1. Obvious applications are low-level compilers for regular expressions, > > parsers and bytecodes but MetaOCaml imposes the limitations of OCaml > > (e.g. slow char and int handling) which makes it unsuitable for most such > > applications. > > Oh, well, you answer some of your own question from your other post. I > was thinking along the lines of ulex. And I have the impression you can > get a nice "finally" with MetaOCaml, albeit perhaps with a weird > syntax. If you mean "try..finally" then that is a trivial syntax extension. I cannot see how MetaOCaml would help. > Now, another obvious application is writing efficient trampoline code > and other combinators, something which I believe may be very useful for > concurrency. Yes. -- Dr Jon Harrop, Flying Frog Consultancy Ltd. http://www.ffconsultancy.com/?e