Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] Alternative Bytecodes for OCaml
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2004-08-26 (21:15)
From: skaller <skaller@u...>
Subject: Re: [Caml-list] Re: bytecode and native code at once
On Fri, 2004-08-27 at 03:09, Paul Snively wrote:

> Is there some reason that asmdynlink, which is part of the Caml 
> Development Kit, doesn't address this?

Its not part of the standard system, requires a patch,
isn't maintained so probably won't work with 1.08:
I also don't know if it's processor specific. 

Its big advantage was compatibility with the bytecode
Dynlink mechanism, which allowed one to fallback to

> I also think that once MetaOCaml gets its native compiler done that it 
> will help answer the question as well, among others. I find MetaOCaml 
> very exciting!

Hmm .. I suspect MetaOcaml has the following problem.
Ideally what we need is a functional method of taking
some parameterised program and sending it arbitrary
constraints, which it then uses to specialise itself,
or verify consistency.

Meta-Ocaml requires you to predict in advance what
the next constraint will be, and write an acceptor
for it which generates an acceptor for the next constraint.

EG: you'd like to say 'do X with a linear operator' and then
tell it:

1) dimensions, diagonal, sparse, values
2) sparse, dimensions, diagonal, values

and have the program optimise itself with both orderings.
MetaOcaml seems to let you do (1), or (2), but not
both with the same program?

John Skaller,
voice: 061-2-9660-0850, 
snail: PO BOX 401 Glebe NSW 2037 Australia
Checkout the Felix programming language

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: