[Noisebridge-discuss] I am working through "The Implementation of Functional Programming Languages"

[Crutcher Dunnavant]

Really? Is there a straight-forward way to compile Scheme down to run
on System F and/or the G Machine? Both systems are based on lazy graph
reduction, and assume immutability of data. I know you could simulate
a mutable machine on top of the G Machine, and then compile Scheme to
run on that, but it isn't a very compelling solution.

On the otherhand, there's the venerable "Build yourself a Scheme in 48
hours", which uses Haskell to build a scheme, and Haskell compiles
down to System F, which then gets projected onto a G Machine. But even
there, you end up simulating mutable state.

On Tue, Oct 27, 2009 at 12:34 PM, dpc <weasel at meer.net> wrote:
> Crutcher Dunnavant <crutcher at gmail.com> writes:
>
>> Unfortunately, those books, and lisp and scheme in general, work with
>> mutators and metaprogramming, which really gets in the way of the things I
>> want to work on. I'd prefer to work with more modern languages.
>
> if you're doing an implementation of a functional language (ie,
> compiling to something) a lot of the bits are going to be
> similar. that's all i meant.
>
> \p
>
> ---
> The truth is more important than the facts. - Frank Lloyd Wright
>



-- 
Crutcher Dunnavant <crutcher at gmail.com>