[Haskell-cafe] Toy implementation of the STG machine

[Don Stewart]

See also:

 * STG machine in Coq,
http://www.cs.ox.ac.uk/files/3858/pirog-biernacki-hs10.pdf

<http://www.cs.ox.ac.uk/files/3858/pirog-biernacki-hs10.pdf>Also

 * ] Jon Mountjoy. The spineless tagless G-machine, naturally. 1998 ACM
SIGPLAN International Conference on Functional Programming,
SIGPLAN Notices, Vol. 34, No. 1, pages 163–173, Baltimore,
Maryland, September 1998. ACM Press.

On Sat, Jun 11, 2011 at 4:32 PM, Thomas Schilling
<nominolo at googlemail.com>wrote:

> Does Bernie Pope's http://www.haskell.org/haskellwiki/Ministg work for
> you?
>
> On 11 June 2011 21:19, Florian Weimer <fw at deneb.enyo.de> wrote:
> > I'm looking for a simple implementation of the STG machine to do some
> > experiments, preferably implemented in something with memory safety.
> > Performance is totally secondary.  I'm also not interested in garbage
> > collection details, but I do want to look at the contents of the
> > various stacks.
> >
> > _______________________________________________
> > Haskell-Cafe mailing list
> > Haskell-Cafe at haskell.org
> > http://www.haskell.org/mailman/listinfo/haskell-cafe
> >
>
>
>
> --
> Push the envelope. Watch it bend.
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20110611/e79c15de/attachment.htm>