G. L. Steele Jr. Rabbit: A compiler for Scheme. Master's thesis, MIT, 1978. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Compiler Approach to Scalable Concurrent Program Design - Foster, Taylor (1992) (11 citations) (Correct)
....to use compile time methods based on source to source transformations so as to avoid run time overheads and achieve our goals of efficient communication, synchronization, and sequential execution. The use of meta programs to specify program transformations is common in declarative programming [3, 28, 38, 12, 5, 42]. Novel features of our approach include the integration of a pro grammable transformer into the compilation pipeline, linguistic support for invocation of transformations, and the use of set oriented abstractions for specifying transformations. An alternative approach to the implementation of ....
Steele, G., Rabbit: A compiler for Scheme, MIT AI Lab TR/474, 1978.
Sober Spaces And Continuations - Taylor (2002) (Correct)
....heating, so we also learn how to use it safely. The mathematical techniques discussed in this paper are closely related to those that have been used by Hayo Thielecke [Thi97a, Thi97b] Carsten Fuhrmann [Fuh99] and Peter Selinger [Sel01] to study computational e#ects. More practically, Guy Steele [Ste78] and Andrew Appel [App92] showed how an ordinary functional program f : U X (without jumps, etc. may be compiled very e#ciently by regarding it as a continuation transformer . This is called the continuation passing style. It may be extended to handle imperative idioms such as jumps, ....
Guy Steele. Rabbit: A compiler for Scheme. Technical Report AI TR 474, MIT, May 1978.
Explicit Polymorphism and CPS Conversion - Harper, Lillibridge (1993) (41 citations) (Correct)
....rwh cs.cmu.edu. Supported by a National Science Foundation Graduate Fellowship. Electronic mail address: mdl cs.cmu.edu. 0 1 Introduction Among the many advances in the theory and practice of programming language design, the concepts of polymorphism [14, 28, 39] and continuation passing [38, 41, 43] are of particular interest. The use of polymorphism in a practical programming language was first explored in ML [15, 28, 29] This style of polymorphism, called implicit polymorphism, is based on the idea that programs are type free, with types interpreted as predicates expressing properties of ....
....[9, 36, 38, 42, 43] Important control constructs such as co routines [21] and user level threads [5, 37] can be defined using primitives for reifying continuations. Conversion into continuationpassing style (CPS) is a useful compilation technique for higher order functional languages [3, 2, 23, 41]. Continuations are central to eliciting the computational content of proofs in classical logic [16, 17, 32] and provide a computational interpretation of classical linear logic [12] The addition of continuation primitives to polymorphic languages has not, however, been an unalloyed success. In ....
Guy L. Steele, Jr. RABBIT: A compiler for SCHEME. Technical Report Memo 474, MIT AI Laboratory, 1978.
First Class Rules and Generic Traversals for Program.. - Dolstra (2001) (Correct)
....in section 5.2. Furthermore, garbage collection is greatly simplified; the only roots of the collector are the activation record of the caller that causes the garbage collection and the static closures (in the data segment) It may be advantageous to convert to continuation passing style [Ste78] to simplify code generation in such a compiler. The reason that we have not implemented this yet is that the C code generator becomes more complex since all details of setting up the activation records must be written out, whereas in the stack based compiler this is done by the C compiler. This ....
G.L. Steele. RABBIT: A compiler for SCHEME. Technical Report AI-TR-474, MIT AI Lab., May 1978.
Local CPS conversion - Reppy (2001) (Correct)
....by binding all intermediate values to variables. Another common representation is continuation passing style (CPS) where function applications are further restricted to occur only in tail positions and function returns are represented explicitly as the tail application of continuation functions [Ste78, KKR 86, App92] In CPS, both the data flow and control flow of the program is made explicit, which makes it well suited to optimizing the program s control structures. While there has been some debate over the relative merits of these two approaches [FSDF93, DD00] it is fair to say that ....
Steele Jr., G. L. Rabbit: A compiler for Scheme. Master's dissertation, MIT, May 1978.
Typed Closure Conversion - Yasuhiko Minamide Greg (Correct)
No context found.
G. L. Steele Jr. Rabbit: A compiler for Scheme. Master's thesis, MIT, 1978.
Compiling and Optimizing Dynamic Parallel Programs - Mark Chu-Carroll Carroll (Correct)
No context found.
Guy L. Steele. Rabbit: A compiler for scheme. Master's thesis AI-TR-474 (1978), MIT. -
From System F to Typed Assembly Language - Greg Morrisett Cornell (1999) (6 citations) (Correct)
No context found.
Steele Jr., G. 1978. Rabbit: A compiler for Scheme. M.S. thesis, MIT.
LISP AND SYMBOLIC COMPUTATION: An International.. - Call-By-Need And.. (Correct)
No context found.
Steele Jr., Guy L. Rabbit: a compiler for Scheme. Technical Report AITR -474, MIT (1978).
Relational Interpretations of Recursive Types in an.. - Lars Birkedal And (1997) (15 citations) (Correct)
No context found.
Steele, Jr., Guy L. 1978. RABBIT: A Compiler for SCHEME. Tech. rept.
Mechanically Verifying Correctness of CPS Compilation - Tian (2006) (Correct)
No context found.
Guy L. Steele, J. (1978), Rabbit: A compiler for scheme, Technical report, Cambridge, MA, USA.
A New Approach to Mobile Code Security - Wallach (1999) (21 citations) (Correct)
No context found.
Guy L. Steele. Rabbit: a compiler for Scheme. Technical Report AITR -474, MIT, Cambridge, Massachusetts, 1978.
Retrospective: - Higher-Order Control-Flow Analysis (Correct)
No context found.
Guy L. Steele Jr. RABBIT: A Compiler for SCHEME. Technical Report 474, MIT AI Lab, May 1978.
The VLISP PreScheme Front End - Ramsdell, Farmer, Guttman, Monk.. (1992) (1 citation) (Correct)
No context found.
Guy L. Steele. Rabbit: A compiler for Scheme. Technical Report 474, MIT AI Laboratory, 1978.
A Verified Compiler for VLISP PreScheme - Oliva, Ramsdell, Wand (1993) (Correct)
No context found.
Steele, Guy L. Rabbit: A Compiler for Scheme. Technical Report 474, MIT AI Laboratory (1978).
The Revised VLISP PreScheme Front End - Ramsdell (1993) (1 citation) (Correct)
No context found.
Guy L. Steele. Rabbit: A compiler for Scheme. Technical Report 474, MIT AI Laboratory, 1978.
A Veri ed Compiler for Multithreaded PreScheme - William Farmer John (Correct)
No context found.
Guy L. Steele. Rabbit: A compiler for Scheme. Technical Report 474, MIT AI Laboratory, 1978.
Explicit Polymorphism and CPS Conversion - Robert Harper Mark (1992) (41 citations) (Correct)
No context found.
Guy L. Steele, Jr. RABBIT: A compiler for SCHEME. Technical Report Memo 474, MIT AI Laboratory, 1978. 20
LISP AND SYMBOLIC COMPUTATION: An International Journal.. - Results And Conclusions (Correct)
No context found.
Guy L. Steele. Rabbit: A compiler for Scheme. Technical Report 474, MIT AI Laboratory, 1978.
Categorical Structure of Continuation Passing Style - Thielecke (1997) (18 citations) (Correct)
No context found.
Guy Steele. Rabbit: A compiler for Scheme. Technical Report AI TR 474, MIT, May 1978.
Dynamic Language - Parallelization By Requirements (Correct)
No context found.
Guy L. Steele Jr. Rabbit: A compiler for Scheme. Technical Report AI-TR-474, MIT, Cambridge, MA, 1978.
Web Interactions - Graunke (2003) (Correct)
No context found.
Steele, Guy L., J. Rabbit: A compiler for Scheme. Master's thesis, MIT, 1978.
On the call-by-value CPS transform and its semantics - Führmann, Thielecke (2003) (3 citations) (Correct)
No context found.
Guy Steele. Rabbit: A compiler for Scheme. AI Technical Report 474, MIT, May 1978.
the Garbage Collection Bibliography - Richard Jones (2003) (Correct)
No context found.
Guy L. Steele. RABBIT: A compiler for SCHEME. Technical report, MIT Press, May 1978.
An Optimizing Compiler for the Icon Programming Language - Walker, Griswold (1992) (2 citations) (Correct)
No context found.
G. L. Steele, `Rabbit: a compiler for Scheme', AI Memo 474, MIT, 1978.
First 50 documents Next 50
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