Mads Tofte and Jean-Pierre Talpin. Implementation of the typed call-by-value #-calculus using a stack of regions. In Proc. 21st Annual ACM Symposium on Principles of Programming Languages, pages 188--201, Portland, OG, January 1994. ACM Press.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....collection is no longer a primitive runtime service, uses no unsafe primitives, and is part of our model of the programming language. Since the collector and mutator are both well typed, we appeal to the fact that Well typed programs do not go wrong. Our language uses a region based type system [27] for safe primitive memory management. The collector is built on top of these safe region primitives. Regions are used to implement the semi spaces of a traditional copying collector. The region type system allows us to verify that it is safe for the collector to deallocate a semispace that ....

.... by others, provides type safe explicit 2 fun gc(from, k, roots) if(need gc(from) then let to = new space( in let roots = copy(from, to, roots) in free space(from) k(to, roots ) else k(from, roots) from to initial copy flip Figure 2: Traditional Garbage Collector memory management [27, 1, 9, 7]. We can use the memory management primitives provided by a region system to guarantee that it is safe to deallocate the from space after the garbage collector has copied all the live data into the to space. Pointer sharing is preserved by the use of forwarding pointers which provide an e#cient ....

[Article contains additional citation context not shown here]

Mads Tofte and Jean-Pierre Talpin. Implementation of the typed call-by-value #-calculus using a stack of regions. In Conference Record of the Twenty-first Annual ACM Symposium on Principles of Programming Languages, ACM SIGPLAN Notices, pages 188--201. ACM Press, January 1994.

....for FX91 [10] brie y mentions an extension of FX91 that uses type annotations to indicate a storage region in which e ects takeplace. Tofte and Talpin describes a system (implemented in The ML Kit and elsewhere) to automatically allocate memory in regions that are collected in a stack discipline [19, 20]. Each region has a speci c lifetime and is not really related to threads. Each region is not garbage collected. Christianson and Velschow extends this idea to Java [6] Hallenberg extends Tofte and Talpin s system as implemented in The ML Kit with garbage collection of individual regions [11] ....

M. Tofte and J.-P.Talpin. Implementation of the typed call-by-value #-calculus using a stack of regions. In ########### #### ############## ######### ## ########## ## ########### #########, pages 188-201, Jan. 1994.

....protection mechanisms is diminished. The goal of this work is to provide a high degree of control over memory management for programmers and compilers, but as in the PCC and TAL frameworks, make verification of the safety of programs a straightforward task. 1. 1 Regions Tofte and Talpin [35, 36] suggest a type and e#ects system for verifying the soundness of region based memory management. In later work, Tofte and others show how to infer region types and lifetimes and how to implement their theory [34, 3, 4] There are several advantages to region based memory management; from our point ....

Mads Tofte and Jean-Pierre Talpin. Implementation of the typed call-by-value #-calculus using a stack of regions. In Twenty-First ACM Symposium on Principles of Programming Languages, pages 188--201, Portland, Oregon, January 1994.

....(#) Figure 10: Exception Handler Compilation By permitting polymorphic typing of subroutines, O Callahan s type system accepts strictly more programs while preserving safety. This type system sheds light on which of the verifier s restrictions are essential and which are not. Tofte and others [8, 33] have developed an allocation strategy using regions. Regions are lexically scoped containers that have a LIFO ordering on their lifetimes, much like the values on a stack. As in our approach, polymorphic recursion on abstracted region variables plays a critical role. However, unlike the objects ....

Mads Tofte and Jean-Pierre Talpin. Implementation of the typed call-by-value #-calculus using a stack of regions. In Twenty-First ACM Symposium on Principles of Programming Languages, pages 188--201, January 1994.

....that control point is reached during execution. Consequently, procedure call must be a primitive construct (which it is in JVML) In contrast, our treatment supports polymorphic stack recursion, and hence procedure calls can be encoded with existing assemblylanguage primitives. Tofte and others [8, 33] have developed an allocation strategy involving regions. Regions are lexically scoped containers that have a LIFO ordering on their lifetimes, much like the values on a stack. As in our approach, polymorphic recursion on abstracted region variables plays a critical role. However, unlike the ....

Mads Tofte and Jean-Pierre Talpin. Implementation of the typed call-by-value #- calculus using a stack of regions. In Twenty-First ACM Symposium on Principles of Programming Languages, pages 188--201, January 1994.

....takes extra, non productive time and can cause erratic pauses in the execution of programs, hampering its use for real time applications. Finally, inter operability between garbage collected languages and non garbage collected languages is difficult. The region calculus of Tofte and Talpin [15, 14] (which we will refer to as TTRC) provides an alternative method of memory management for the functional language ML [10] It is used as an intermediate language in an ML compiler, the ML kit [2, 3, 12, 14, 15] The basic idea of the region calculus is to split memory into regions that are ....

....and non garbage collected languages is difficult. The region calculus of Tofte and Talpin [15, 14] which we will refer to as TTRC) provides an alternative method of memory management for the functional language ML [10] It is used as an intermediate language in an ML compiler, the ML kit [2, 3, 12, 14, 15]. The basic idea of the region calculus is to split memory into regions that are allocated in a stack like manner, directed by a construct of the language. Deallocation is instantaneous, it just pops the topmost region from the stack. Using this method, it is possible to implement ML without a ....

[Article contains additional citation context not shown here]

Mads Tofte and Jean-Pierre Talpin. Implementation of the typed call-by-value #-calculus using a stack of regions. In Proc. 21st Annual ACM Symposium on Principles of Programming Languages, pages 188--201, Portland, OG, January 1994. ACM Press.

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