|Detailed Compiler Stages of a Statically Typed, Strict Functional Lang email@example.com (Scott) (2011-02-24)|
|Re: Detailed Compiler Stages of a Statically Typed, Strict Functional firstname.lastname@example.org (2011-02-28)|
|From:||email@example.com (Torben Ęgidius Mogensen)|
|Date:||Mon, 28 Feb 2011 09:35:23 +0100|
|Organization:||SunSITE.dk - Supporting Open source|
|Posted-Date:||01 Mar 2011 11:04:11 EST|
Scott <firstname.lastname@example.org> writes:
> I am seeking reasonably canonical information on the compiler stages,
> perhaps repeatedly or recursively invoked, of a strict evaluation,
> statically typed functional language compiler.
I would suggest Andrew Appel's book "Compiling with Continuations". It
gives a detailed overview of the design of (an early version of) the
Standard ML of New Jersey compiler. It is a bit dated now (and probably
long out of print), but still very readable, and I haven't seen any
quite as comprehensive text that covers all the phases. In any case,
Standard ML is the canonical statically typed, strict functional
language, so it is a very good place to start.
Return to the
Search the comp.compilers archives again.