On Monday 27 October 2003 10:14, Damien wrote:
> On Mon, 27 Oct 2003 01:41:49 -0000 Ben Kavanagh wrote:
> > Say I have a function such as pow defined as
> >
> > let pow n x =
> > [skip]
> >
> > let pow2 = pow 2
> >
> > Are there any ML implementations that would automatically perform
> > partial evaluation to create pow2 instead of using closures, possibly
> > unfolding the pow_iter call? Would Caml ever have this capability?
>
> Multi-Stage Programming is your friend...
> <http://www.cs.rice.edu/~taha/MSP/>
>
> There are two ML implementations :
> Ocaml : MetaOCaml <http://www.cs.rice.edu/~taha/MetaOCaml/>
> SML : MetaML <http://www.cse.ogi.edu/PacSoft/projects/metaml/>

May I also humbly draw your attention to Dynamic Caml:
http://oops.tercom.ru/dml

:)

Friendly,
Dmitry
-- 
Dmitry Lomov
IntelliJ Labs / JetBrains Inc.
http://www.intellij.com
"Develop with pleasure!"


-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners