[Date Prev] [Date Next] [Thread Prev] [Thread Next] Date Index Thread Index Search archive:
Date:Mon May 12 16:11:54 1994 
Subject:Re: Functional Programming Languages with Lazy Evaluation 
From:pop 
Volume-ID:940513.04 

I actually have an unfinished implementation of Haskell that I did in
Glasgow. Essentially the POPLOG VM can be made to correspond quite well
with the STG machine that is one of the -modern- ways to implement
functional languages. The main mismatch is that the STG machine is very
dense in its creation of closures, so that the balance between the cost of
creation of a closure and the cost of using the closure is rather crucial.
Poplog closures are cheap to use (being real code) but rather expensive in
store and cycles to create. Also STG stands for Spineless TAGLESS
G-machine. And Poplog is not of course tagless. However for mixed language
working the tagging would be essential.

Explicit graph reduction is vieux chapeau.


Robin.