Re: Implementing Closures

Tony Finch <dot@dotat.at>
29 Apr 2009 16:08:20 +0100 (BST)

          From comp.compilers
Related articles
[2 earlier articles]
Re: Implementing Closures dot@dotat.at (Tony Finch) (2009-04-26)
Re: Implementing Closures barry.j.kelly@gmail.com (Barry Kelly) (2009-04-26)
Re: Implementing Closures cr88192@hotmail.com (cr88192) (2009-04-26)
Re: Implementing Closures torbenm@pc-003.diku.dk (2009-04-28)
Re: Implementing Closures pertti.kellomaki@tut.fi (Pertti Kellomaki) (2009-04-29)
Re: Implementing Closures torbenm@pc-003.diku.dk (2009-04-29)
Re: Implementing Closures dot@dotat.at (Tony Finch) (2009-04-29)
Re: Implementing Closures haberg_20080406@math.su.se (Hans Aberg) (2009-04-29)
Re: Implementing Closures rpw3@rpw3.org (2009-05-01)
Re: Implementing Closures rpw3@rpw3.org (2009-05-01)
| List of all articles for this month |
From: Tony Finch <dot@dotat.at>
Newsgroups: comp.compilers
Date: 29 Apr 2009 16:08:20 +0100 (BST)
Organization: dotat labs
References: 09-04-056 09-04-075 09-04-084 09-04-087
Keywords: storage, functional, ML
Posted-Date: 29 Apr 2009 11:45:26 EDT

torbenm@pc-003.diku.dk (Torben =?iso-8859-1?Q?=C6gidius?= Mogensen) wrote:
>Pertti Kellomaki <pertti.kellomaki@tut.fi> writes:
>> Torben Fgidius Mogensen wrote:
>>>
>>> You can also do closure conversion: Transform the source program so
>>> all building of closures is done at the source level.
>>
>> Are there some relatively well known systems that use this approach?
>
>Many implementations of SML, including SML of New Jersey, do this.


In the lazy functional programming language literature (i.e. mostly
Haskell) it's often called "lambda lifting".


Tony.
--
f.anthony.n.finch <dot@dotat.at> http://dotat.at/
SHANNON ROCKALL: CYCLONIC BECOMING NORTHWESTERLY, 5 OR 6, DECREASING 4 OR 5
LATER. MODERATE OR ROUGH. RAIN THEN SQUALLY SHOWERS, FAIR LATER. MODERATE OR
GOOD.


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.