R. Kent Dybvig. Three Implementation Models for Scheme. PhD thesis, University of North Carolina, Chapel Hill, April 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and hence garbage collect the stack. This is an attractive option when one is able to design and implement both the compiler and virtual machine, because it gives reasonable performance and makes the implementation of call cc extremely easy and ecient. Another option, discussed by Dybvig in [4], is to use a traditional stack for call frames, and implement call cc by copying the current stack into the heap. This approach gives excellent performance for most Scheme programs, but heavily penalizes the use of call cc. Unfortunately, neither of these approaches are viable for systems on top ....

R. Kent Dybvig. Three Implementation Models for Scheme. PhD thesis, University of North Carolina, Chapel Hill, April 1987.

....diOEcult to implement tail call optimizations in a dedicated Scheme run time system. It is more diOEcult when compiling a Scheme program to C or other higherlevel languages. One way to implement tail call optimization in that situation is with the 1 There exist other layouts, such as string based [17], but those are rarely used. 80 trampoline technique [31] With the trampoline technique, function calls and returns are made by returning a function pointer to a loop that immediately calls the returned function. The dynamic chain must be created explicitly instead of implicitly, which gives ....

R. Kent Dybvig. Three Implementations Models for Scheme. PhD thesis, University of North Carolina, April 1987. URL: ftp://cs.indiana.edu/pub/scheme-repository/ txt/3imp.ps.Z.

....code. The underlying model is a vectorial stack but when continuations are caught the stack is broken into pieces maintained in a linked list of stack segments[11] Several people have been working on the development of Chez Scheme since its first implementation, by its inventor R. Kent Dybvig [10]. This has resulted in a general, e#cient implementation of Scheme. Chez Scheme is the major source of inspiration for Isis. Several features from Chez Scheme have been adopted in Isis: the macro system, which is the same macro system as in Chez Scheme; separate compilation; and parameters, which ....

R. Kent Dybvig. Three Implementation Models for Scheme. PhD thesis, University of North Carolina at Chapel Hill, April 87.

....can place an unusual demand on heap management, especially where programs do not need it and might do better to exploit a hardware stack, just as C always does. Some compilers of applicative languages manage to eliminate heap resident continuations for algorithms that could also be expressed in C [13]. Such a compilation would be necessary for a fair comparison to C, and is suggested by our experience with this design. The present implementation is a board level prototype installed as an I O device on a bus, but the underlying design supports VLSI implementation [36] like ordinary dynamic ....

....You to MACH s designers, for providing preservation of transparent translation tables, to NeXT for most generously providing us NBICs and prototype boards. to Bob Wehrmiester for early help on hardware, to Peter Beckman for preparing the matrix data, and to Esen Tuna for loaning us a compiler [13]. Thanks also to anonymous referees for helpful comments. ....

R. K. Dybvig. Three Implementation Models for SCHEME, Ph.D. dissertation, Univ. of North Carolina at Chapel Hill (April 1987).

....and do private put the value of a variable definition into the public or the private environment. The most interesting part of Figure 21 is the letrec expression, which is used to establish bindings for free variables in m1. The procedure get box returns a box object (an indirection cell) [21, 43] associated with an entry of the private environment. The box is used to reference or to assign free variables that are bound to locally defined private variables. It seems that allocating boxes for private variables is unnecessary, since they are not visible outside the letrec expression. ....

Dybvig, R. K. Three Implementation Models for Scheme. PhD thesis, University of North Carolina, Chapel Hill, 1987.

....activation records. In the presence of continuations, this stack is often implemented as a linked list to facilitate the capture and invocation of continuations as objects. It is also possible to employ a true stack by copying continuations that have been captured before they are modified [7, 5, 3]. With either implementation, it is possible to place a constant bound on the amount of work that must be performed by the continuation operations regardless of the size of the current continuation[17] Subcontinuations can be implemented in a similar manner with little additional overhead. ....

Dybvig, R. Kent. Three Implementation Models for Scheme. PhD thesis, University of North Carolina, Chapel Hill (April 1987).

....model is a simple generalization of the traditional stack model. By implementing the control stack as a linked list of stack segments, continuation operations are bounded by the size of the top segment instead of the size of the entire control stack. parameters if the parameters are assignable [6, 13]. It is also possible to pass the return address and the first few arguments in registers, leaving a hole in the frame in which the return address can be placed if the called routine itself makes a recursive call. The remaining words in the frame contain the values of local variables, compiler ....

R. Kent Dybvig, Three Implementation Models for Scheme, University of North Carolina at Chapel Hill Department of Computer Science Technical Report #87011 (PhD Dissertation), April 1987.

No context found.

R. K. Dybvig. Three Implementation Models for Scheme. PhD thesis, Department of Computer Science, University of North Carolina at Chapel Hill, 1987. Technical Report TR87-011. Available from: http://www.cs.indiana.edu/scheme-repository/.

No context found.

Kent R. Dybvig. Three Implementation Models for Scheme, Technical Report 87-011, University of North Carolina at Chapel Hill, April 1987.

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