Dan Grossman. Existential types for imperative languages. In 11th European Symposium on Programming, volume 2305 of Lecture Notes in Computer Science, pages 21--35. SpringerVerlag, 2002.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....consequences in behavioural theories, most notably in the properties of the generic transition relation, as we shall discuss in Section 7. 3. 5 Extension (2) Sequential State The integration of imperative features and polymorphism in programming is an old and challenging technical problem [13, 22, 37]. Here we present a basic extension of ane polymorphic processes to stateful computation which is enough for our present purpose. Following [17] we add a constant called reference agent, written Refhxyi, to extend the class of behaviour. Accordingly we also introduce related constructs, branching ....

....form. By considering M to be a supertype of , this may lead to a new e ective type inference for ML like languages, though details are to be seen. Stateful polymorphism of another kind come from existentials, which are, in the present setting, the precise dual of universals. It is Grossman [13] who rst analysed a non trivial (and sometimes disastrous) interplay between struct and existential, which we analyse below using our typed calculus. 12 Example 3. Grossman s examples in the calculus) The following is Grossman s example. struct T exists X. void ( f) int, X) X env ; void ....

Grossman, D. Existential types for imperative languages. In ESOP02 (2002), LNCS 2305, Springer, pp. 21-35.

....consequences in behavioural theories, most notably in the properties of the generic transition relation, as we shall discuss in Section 7. 3. 5 Extension (2) Sequential State The integration of imperative features and polymorphism in programming is an old and challenging technical problem [13, 22, 37]. Here we present a basic exten sion of afiqne polymorphic processes to stateful computation which is enough for our present purpose. Following [17] we add a constant called reference agent, written Ref(xy) to extend the class of behaviour. Accordingly we also introduce related constructs, ....

....this form. By considering to be a supertype of , this may lead to a new effective type inference for ML like languages, though details are to be seen. Stateful polymorphism of another kind come from existentials, which are, in the present setting, the precise dual of universals. It is Grossman [13] who first analysed a non trivial (and sometimes disastrous) interplay between struct and existential, which we analyse below using our typed calculus. 12 Example 3. Grossman s examples in the w calculus) Thefollowing is Gross man s example. struct T exists X. void ( f) int, X) X env ; void ....

GROSSMAN, D. Existential types for imperative languages. In ESOPO (2002), LNCS 2305, Springer, pp. 21-35.

....of the central results. Theorem 1. strong normalisability) Let P .A in linear polymorphic typing. Then P is strongly normalising with respect to . 3. 5 Extension (2) State and Concurrency The integration of imperative features and polymorphism is an old and challenging technical problem [10, 16, 29]. Here we present a basic extension of ane polymorphic processes to stateful computation. Following [12] we add a constant process Refhxyi, called reference agent. For interacting with reference, we need selection xin i h zi which selects, in the case of reference, either read (i = 1) or write (i ....

....universally abstracted, in accordance with restriction to simple types. In spite of this limitation, a wide variety of imperative polymorphic programs are typable via encoding: for example, all benchmark programs in Leroy s thesis [16] as well as Grossman s integrations of struct with existentials [10] are typable. This is due to the distinction between two replicated types, and M . For further discussions, see [6] For incorporating concurrency, we simply ignore all IO modes in each rule. Section 6 presents equational reasoning for stateful polymorphic processes. 4 Contextual Congruence ....

Grossman, D. Existential types for imperative languages. In ESOP02 (2002), LNCS 2305, Springer, pp. 21-35.

No context found.

Dan Grossman. Existential types for imperative languages. In 11th European Symposium on Programming, volume 2305 of Lecture Notes in Computer Science, pages 21--35. SpringerVerlag, 2002.

No context found.

Dan Grossman. Existential types for imperative languages. In 11th European Symposium on Programming, volume 2305 of Lecture Notes in Computer Science, pages 21--35, Grenoble, France, April 2002. Springer-Verlag.

....closure is later invoked, then it might dereference the dangling pointer. This is the critical problem that Tofte and Talpin address for functional languages. Cyclone does not have closures, but it has other typing constructs that hide regions. In particular, Cyclone provides existential types [22, 14], which su#ce to encode closures [21] and simple forms of objects [5] Therefore, it is possible in Cyclone for pointers to escape the scope of their regions. To address this problem, the Cyclone type system keeps track of the subset of region names that are considered live at each control flow ....

....expect these tags on the data, and to support time saving and space saving optimizations. However, we have found that the DML framework does not easily extend to imperative languages such as Cyclone. In particular, there are subtle issues involving existential types and the address of ( operator [14]. Acknowledgments We would like to thank David Walker for fruitful discussions, and Steve Zdancewic and Je# Vinocur for proofreading this manuscript. 9. ....

D. Grossman. Existential types for imperative languages. In Eleventh European Symposium on Programming, pages 21--35, Grenoble, France, Apr. 2002.

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