Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!usc!apple!snorkelwacker!spdcc!esegue!compilers-sender From: briscoe-duke@CS.YALE.EDU (Duke Briscoe) Newsgroups: comp.compilers Subject: Re: Intermediate Representation Keywords: coded, denotational semantics, optimize Message-ID: <1990Aug08.171413.13815@esegue.segue.boston.ma.us> Date: 8 Aug 90 17:14:13 GMT Sender: compilers-sender@esegue.segue.boston.ma.us Reply-To: Duke Briscoe Organization: Compilers Central Lines: 24 Approved: compilers@esegue.segue.boston.ma.us In-Reply-To: <1990Aug07.153407.8877@esegue.segue.boston.ma.us> You might be interested in the following PhD thesis: Compilation by Program Transformation Richard Kelsey Yale University May 1989 Abstract: This dissertation describes a simple compiler, based on concepts from denotational semantics, that can be used to compile standard programming languages and produces object code as efficient as that of production compilers. The compiler uses only source-to-source transformations. The transformations are performed on programs that have been translated into an intermediate language resembling the lambda calculus. The output of the compiler, while still in the intermediate language, can be trivially translated into machine code for the target machine. The compilation-by-transformation strategy is simple: the goal is to remove any dependencies on the intermediate language semantics that the target machine cannot implement directly. Front-ends have been written for Pascal and Basic, and the compiler produces code for the MC68020 microprocessor. -- Send compilers articles to compilers@esegue.segue.boston.ma.us {spdcc | ima | lotus| world}!esegue. Meta-mail to compilers-request@esegue.