Lars Birkedal and Mads Tofte. A constraint-based region inference algorithm. Theoretical Computer Science, 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....found its way in many modern languages such as Smalltalk, ML and Java. The desire to have static control of memory management, retaining deallocation safety, led to the introduction of regions [14,27,48,52] Region annotations can be automatically inferred by means of a type and e ect analysis [6, 49, 50, 53]. As such, it is possible to eliminate the runtime cost of trace based garbage collection without losing deallocation safety. Based on the region calculus by Tofte and Talpin [53] the ML kit [51] a compiler for the functional programming language Standard ML [36] implements a practical ....

Lars Birkedal and Mads Tofte. A constraint-based region inference algorithm. Theoretical Computer Science, 58:299-392, 2001.

....found its way in many modern languages such as Smalltalk, ML and Java. The desire to have static control of memory management, retaining deallocation safety, led to the introduction of regions [14, 27,46, 50] Region annotations can be automatically inferred by means of a type and e#ect analysis [6,47,48,51]. As such, it is possible to eliminate the runtime cost of trace based garbage collection without losing deallocation safety. Based on the region calculus by Tofte and Talpin [51] the ML kit [49] a compiler for the functional programming language Standard ML [34] implements a practical ....

Lars Birkedal and Mads Tofte. A constraint-based region inference algorithm. Theoretical Computer Science, 58:299--392, 2001.

....found its way in many modern languages such as Smalltalk, ML and Java. The desire to have static control of memory management, retaining deallocation safety, led to the introduction of regions [14, 27,46, 50] Region annotations can be automatically inferred by means of a type and e ect analysis [6,47,48,51]. As such, it is possible to eliminate the runtime cost of trace based garbage collection without losing deallocation safety. Based on the region calculus by Tofte and Talpin [51] the ML kit [49] a compiler for the functional programming language Standard ML [34] implements a practical ....

Lars Birkedal and Mads Tofte. A constraint-based region inference algorithm. Theoretical Computer Science, 58:299-392, 2001.

....for Standard ML [40] without trace based garbage collection [59] and forms the basis for the o ine partial evaluator of this paper. A region is a part of memory of potentially unbounded size. In , regions are allocated and deallocated as a whole in a stack like manner. Region inference [3, 57,58] translates an ML typeable program into a expression. The following grammar de nes its terms: RegionTerm 3 e : x j c at j x: e at j e e j lift [ 1 ; 2 ] e j : e j let x = e in e j f [ 1 ; n ] at j letrec f = 1 ; n : x: e at in e Constants and ....

....which is a desirable factorization for a BTA [53] Secondly, the ow analysis part of our BTA is almost as accurate as the powerful data dependency analysis obtained by region inference. Moreover, since we can recycle the polynomial time region reconstruction algorithms by Birkedal and Tofte [3, 57], it is only necessary to design and implement a constraint analysis algorithm on top of region inference. The result of the constraint analysis is a constraint annotated term, where constraints express binding time dependencies between regions, containing actual runtime objects. Since ....

[Article contains additional citation context not shown here]

Lars Birkedal and Mads Tofte. A constraint-based region inference algorithm. Theoretical Computer Science, 58:299-392, 2001.

....for Standard ML [40] without trace based garbage collection [59] and forms the basis for the o#ine partial evaluator of this paper. A region is a part of memory of potentially unbounded size. In # , regions are allocated and deallocated as a whole in a stack like manner. Region inference [3,57,58] translates an ML typeable program into a # expression. The following grammar defines its terms: RegionTerm # #. e Constants and lambda expressions are values and the annotation at # indicates that the object is to be allocated in the region bound to #. Regions are ....

....which is a desirable factorization for a BTA [53] Secondly, the flow analysis part of our BTA is almost as accurate as the powerful data dependency analysis obtained by region inference. Moreover, since we can recycle the polynomial time region reconstruction algorithms by Birkedal and Tofte [3, 57], it is only necessary to design and implement a constraint analysis algorithm on top of region inference. The result of the constraint analysis is a constraint annotated # term, where constraints express binding time dependencies between regions, containing actual runtime objects. Since ....

[Article contains additional citation context not shown here]

Lars Birkedal and Mads Tofte. A constraint-based region inference algorithm. Theoretical Computer Science, 58:299--392, 2001.

....found its way in many modern languages such as Smalltalk, ML and Java. The desire to have static control of memory management, retaining deallocation safety, led to the introduction of regions [13, 23,41, 45] Region annotations can be automatically inferred by means of a type and e ect analysis [6,42,43,46]. In this case, it is possible to eliminate the runtime cost of trace based garbage collection without losing deallocation safety. The ML kit [44] a compiler for the Institut f ur Informatik, Georges K ohler Allee Geb. 079, D 79110 Freiburg, Germany. Tel: 49 7612038053, Fax: 49 7612038052, ....

Lars Birkedal and Mads Tofte. A constraint-based region inference algorithm. Theoretical Computer Science, 58:299-392, 2001.

....Programming Languages (POPL 2001) c 2001 by ACM. useless, and add (constant time) operations for reclaiming memory in xed position inside the code generated during compilation. This is the approach adopted in the design of region and e ect systems [17] and in particular in the region calculus [19, 20, 18, 5, 6, 1], extending traditional type systems with regions and e ects annotations. The syntax of the region calculus extends the call by value typed lambda calculus with region annotations and a construct for allocating regions using a stack discipline. The store is a collection of regions, each behaving ....

L. Birkedal and M. Tofte. A constraint-based region inference algorithm. Theoretical Computer Science, 1998.

....languages, like ML, and non garbage collected languages, such as C, is dicult. The region calculus of Tofte and Talpin [14, 15] TTRC) provides an alternative method of memory management for the functional language ML [11] It is used as an intermediate language in an ML compiler, the ML kit [3,4,13 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 ....

Lars Birkedal and Mads Tofte. A constraint-based region inference algorithm. Theoretical Computer Science, to appear, 1999.

....collected languages, like ML, and non garbage collected languages, such as C, is dicult. The region calculus of Tofte and Talpin [16, 17] provides an alternative method of memory management for the functional language ML. It is intended and used as an intermediate language in an ML compiler [2,3,15 17]. The basic idea 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 garbage collection (in ....

Lars Birkedal and Mads Tofte. A constraint-based region inference algorithm. Theoretical Computer Science, to appear, 1999.

....in the (call by value) region calculus. Finally, we given an example (in Section 6) and conclude. Due to lack of space, we can only include a very limited account of the region calculus. For the problem of region inference, on which our analysis builds, we refer to the respective publications [3, 18]. Related work In earlier work, Thiemann [16] considered another region calculus [15] as the basis of a binding time analysis. However, that work covered a monovariant analysis for a simply typed language. In addition, it was geared at the treatment of impure e ects on reference cells. It would ....

Lars Birkedal and Mads Tofte. A constraint-based region inference algorithm. Theoretical Computer Science, to appear, 1999.

No context found.

Lars Birkedal and Mads Tofte. A constraint-based region inference algorithm. Theoretical Computer Science, 1999.

....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 ....

Lars Birkedal and Mads Tofte. A constraint-based region inference algorithm. Theoretical Computer Science, 58:299--392, 2001.

....and non garbage collected languages is difficult. The region calculus of Tofte andTalpin [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 ....

Lars Birkedal and Mads Tofte. A constraint-based region inference algorithm. Theoretical Computer Science, 58:299--392, 2001.

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