One of the interesting things about implementing Scheme in Haskell could be capturing Scheme's dynamic typing in an efficient way. For a "simple" interpreter of a fairly closed language, maybe this wouldn't be a problem. I have a vague recollection of a paper on compiling Scheme to SML that deal with this issue. Oddly enough, this is not in the Scheme bibliography at present. If I can find it, I will add it soon. (Of course, if someone knows the project I am thinking of: please send me a link!)
Jim Bender http://readscheme.org _______________________________________________ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
