Hi Stefan I always wanted to understand what a tail recursive execution for smalltalk (I know for the other) would bring to a smalltalk system. We got a lot of discussion during a dagsthul seminar with schemers and others. I would really like to know what would be gain and the cost (implementation wise to do that). Stef On Jul 4, 2010, at 10:26 AM, Stefan Marr wrote:
Hello Pharo:
What would it take to implement tail-call optimization?
My goal is to have an Erlang-like framework, which allows to port existing Erlang code as straight forward as possible. But this requires to have tail-call optimization, since Erlang provides no loops.
However, I am not going for implementing the whole language and all its semantics, but only the basics I am interested in.
So, a possible solution would also be a pragma/hint to the compiler to apply the optimization.
Has anyone done something like this before, or has some hints where to start digging?
Thanks Stefan
-- Stefan Marr Software Languages Lab Vrije Universiteit Brussel Pleinlaan 2 / B-1050 Brussels / Belgium http://soft.vub.ac.be/~smarr Phone: +32 2 629 2974 Fax: +32 2 629 3525
_______________________________________________ Pharo-project mailing list Pharo-project@lists.gforge.inria.fr http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project