Richard Andrews Kelsey, "Compilation by Program Transformation," Yale University, PhD Diss., May 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Pre-Scheme: A Scheme Dialect for Systems Programming - Kelsey (1997) (6 citations) Self-citation (Kelsey) (Correct)
....performance comparable to that of low level languages is occasionally claimed for implementations of high level languages, these claims are typically based on small benchmarks and not on full applications. The current Pre Scheme compiler produces C code and is based on the compiler described in [8, 7]. It has been used to compile the Scheme 48 virtual machine [9] a moderate sized program that includes a byte code interpreter and garbage collector. This particular application program, written in Pre Scheme and compiled by the PreScheme compiler, performs as well as comparable programs written ....
....performs type checks and coercions, and executes the body of the instruction. This is a simple Scheme macro that would be painful, if not impossible, to write using C s limited macro facility. 5 Implementation The current Pre Scheme compiler is based on the transformational compiler described in [8, 7]. It uses the following optimization techniques: ffl Beta reduction (substituting known values for variables) ffl Block compilation. The entire program is compiled at once. This maximizes the opportunities for performing beta reduction. It also increases the number of programs that will be ....
Richard Kelsey. Compilation by program transformation. Technical Report YALEU/DCS/TR-702, Department of Computer Science, Yale University, New Haven, CT, 1989.
Realistic Compilation by Program Transformation - Kelsey, Hudak (1989) (49 citations) Self-citation (Kelsey) (Correct)
....pointers are less efficient than stack environments and implicit environment pointers the goal of the compiler is to use as few heap environments and explicit environment pointers as possible. In the remainder of this section we describe each of these steps detail. For even more detail, see [Kelsey 89] 5.1 Translating Source Code into Intermediate Language Initially, a front end specific to the source language translates the program into the compiler s intermediate language. Different front ends are needed for different programming languages. Each consists of a translator from the source ....
Richard Kelsey. Compilation by Program Transformation. PhD thesis, Yale University, 1989.
Pattern-Based Languages for Prototyping of Compiler Optimizers - Charles Donald Farnum (1990) (3 citations) (Correct)
No context found.
Richard Andrews Kelsey, "Compilation by Program Transformation," Yale University, PhD Diss., May 1989.
Retrospective: - Higher-Order Control-Flow Analysis (Correct)
No context found.
Richard A. Kelsey. Compilation by Program Transformation. Ph.D. dissertation, Yale University, May 1989. Research Report 702, Department of Computer Science.
Generational copying garbage collection for Standard ML: a.. - Stefanovic (1993) (1 citation) (Correct)
No context found.
Richard Andrews Kelsey. Compilation By Program Transformation. PhD thesis, Department of Computer Science, Yale University, New Haven, Connecticut, May 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC