Re: Implementing Closures

Hans Aberg <haberg_20080406@math.su.se>
Wed, 29 Apr 2009 22:31:00 +0200

          From comp.compilers
Related articles
[3 earlier articles]
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: Hans Aberg <haberg_20080406@math.su.se>
Newsgroups: comp.compilers
Date: Wed, 29 Apr 2009 22:31:00 +0200
Organization: Aioe.org NNTP Server
References: 09-04-056 09-04-075 09-04-084 09-04-087 09-04-089
Keywords: storage, functional
Posted-Date: 01 May 2009 19:18:15 EDT

Tony Finch 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".


There is a description of it here:
      http://en.wikipedia.org/wiki/Lambda_lifting


      Hans Aberg


Post a followup to this message

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