Related articles |
---|
Representing Closures in C johan.tibell@gmail.com (Johan Tibell) (2006-07-21) |
Re: Representing Closures in C haberg@math.su.se (2006-07-21) |
Re: Representing Closures in C tommy.thorn@gmail.com (Tommy Thorn) (2006-07-21) |
Re: Representing Closures in C johan.tibell@gmail.com (Johan Tibell) (2006-07-22) |
Re: Representing Closures in C wyrmwif@tsoft.org (SM Ryan) (2006-07-23) |
Re: Representing Closures in C haberg@math.su.se (2006-07-23) |
Re: Representing Closures in C tommy.thorn@gmail.com (Tommy Thorn) (2006-07-25) |
Re: Representing Closures in C tommy.thorn@gmail.com (Tommy Thorn) (2006-07-25) |
[1 later articles] |
From: | haberg@math.su.se (Hans Aberg) |
Newsgroups: | comp.compilers |
Date: | 21 Jul 2006 16:01:25 -0400 |
Organization: | Mathematics |
References: | 06-07-051 |
Keywords: | storage, functional |
Posted-Date: | 21 Jul 2006 16:01:25 EDT |
"Johan Tibell" <johan.tibell@gmail.com> wrote:
> I'm writing a small lambda calculus interpreter in C.
> Any good articles or papers out there? What I'm looking for is a
> hands-on description of how it can be done in C.
Simon Peyton Jones has written two books on the implementation of
functional languages, both with full text available online:
http://research.microsoft.com/~simonpj/Papers/papers.html
The book by Abelson & Sussman, "Structure..." has some implementation
stuff though written in Scheme. You might want to check out say the
implementation of Hugs <http://haskell.org/hugs/>, though this is an
interpreter of a typed, lazy functional language: Haskell.
--
Hans Aberg
Return to the
comp.compilers page.
Search the
comp.compilers archives again.