B. Thomsen. Polymorphic sorts and types for concurrent functional programs. In J. Glauert, editor, Proceedings of the 6th International Workshop on the Implementation of Functional Languages, Norwich,UK, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of Facile presents a monomorphic type system for Facile. However, the implementation adopts the weak polymorphic type system of Standard ML of New Jersey [53] The authors have also presented a polymorphic sound type and effect system for a subset of Facile along with a type inference algorithm [64]. 5.6 Formal foundations A clean and well understood semantics has been the main motivation from the very early days of Facile. This has lead to a number of works for the formal foundations of Facile such as [62, 65, 66] It continues to be of interest to researchers of process calculi. 5.7 ....

B. Thomsen. Polymorphic sorts and types for concurrent functional programs. In J. Glauert, editor, Proceedings of the 6th International Workshop on the Implementation of Functional Languages, Norwich,UK, 1994.

....in ML like languages [25] and by Tofte and Talpin to improve memory management techniques [30] The same approach was later carried over to concurrent programming languages where effect information was used in safe generalisation of channel types. The work 22 by Thomsen on the language Facile [28] and Bolignano and Debbabi on Concurrent ML [4] are examples of this. Another line of research in the literature demonstrates that the exploitation of type and effect systems need not be confined to the enforcement of type safety in the above sense. Annotated with effects and other kinds of ....

B. Thomsen. Polymorphic sorts and types for concurrent functional programs. In J. Glauert, editor, Proceedings of the 6th International Workshop on the Implementatin of Functional Languages, Norwich,UK, 1994.

....of Computer Science, The University of Edinburgh, King s Buildings, Mayfield Road, Edinburgh, EH9 3JZ, Scotland, UK. Fax : 44 131 667 72 09, Email : zdk dcs.ed.ac.uk 1 this property. Our type system is a direct descendant of the former type and e#ect systems proposed for ML [6] and Facile [7] which dealt with the problem of providing polymorphism in the presence of features for imperative and concurrent computation and those which were used for communication analyses [4] A significant advantage of using the type and e#ect discipline is that providing ML style polymorphism in this new ....

B. Thomsen. Polymorphic sorts and types for concurrent functional programs. In J. Glauert, editor, Proceedings of the 6th International Workshop on the Implementatin of Functional Languages, Norwich,UK, 1994.

....server example is essentially a transliteration of the first example in Chapter 5) Unfortunately, the type of id can never be polymorphic, because the type of channel is weakly polymorphic. val id = channel( fun server( let val (x,r) receive(ch) in send(r,x) server( end Thomsen [Tho93] illustrates how one can improve upon the behaviour of polymorphic channels using an effect system (in the context of the Facile language) CHAPTER 10. RELATED WORK 168 However, even though his type system is quite complicated he is still not able to allow the type of id be polymorphic. 10.4 ....

Bent Thomsen. Polymorphic sorts and types for concurrent functional programs. Technical Report ECRC--93--10, European ComputerIndustry Research Centre, 1993.

....aspects, the idea being to associate with an expression not only its type but also the side effects of its evaluation. Nielson and Nielson have proposed a monomorphic effect type discipline for CML [NN93] Here the effect of executing a CML expression was a process calculus term. In [Tho93] Thomsen proposed a very different effect polymorphic effect type discipline for the Facile language, and independently, in [BD94] Bolignano and Debabi gave a very similar type discipline for a subset of Concurrent ML here, the effect of a program is the sort of the program, i.e. the set of ....

Bent Thomsen. Polymorphic Sort and Types for Concurrent Functional Programs. Technical report, European Computer-Industry Research Centre, June 93. ECRC-93-10.

....Tygar and Peter Lee, my other committee members, for spending the time and energy to review my dissertation and to offer many helpful comments. They challenged my arguments and sharpened my thinking. I relied greatly on members of the Facile group as the technical support team for my thesis. Bent Thomsen and Lone Leth were always willing to lend an ear when I burst in with my latest question. Tsung Min Kuo patiently explained distributed typing and other concepts to me. Andr e Kramer helped me track down bugs and work out implementation approaches, and always kept an eye out for references ....

Bent Thomsen, 1994. Polymorphic sorts and types for concurrent functional programs.

....: ha i(N il ) N il) N il On a more speculative level we would like to understand the relationships between specifications and types for higher order process calculi. For instance, type systems for concurrent applicative languages such as CML and Facile have been recently proposed [14, 21] which partially describe the input output behaviour of a program. Is there a connection between these types and specifications as presented here Acknowledgments. We are indebted to Lone Leth, Sanjiva Prasad, and Bent Thomsen for several discussions on the topics presented here. ....

B. Thomsen. Polymorphic sorts and types for concurrent functional programs. Technical report, ECRC, TR-93-10, 1993.

.... of concurrent and strict functional languages include Concurrent ML [14] and Facile [13] A formal operational semantics of a Concurrent ML like language is given in [1, 14] A sound type system for the concurrent language is presented in [14] and a type system for Facile is given in [16]. In the present paper typing issues have been ignored, and attention has been focused instead on the more general problem of reasoning about the behaviour of programs. ....

B. Thomsen. Polymorphic sorts and types for concurrent functional programs. In John Glauert, editor, Proceedings of the 6th International Workshop on the Implementation of Functional Languages, 7-9 September 1994, UEA Norwich, UK, 1994.

....that propagates the communication effects that result from channel creation, sending, and receiving. In [NN93a, NN93b, NN94a, NN94b] H. R. Nielson and F. Nielson presented several type systems for type and behavior inference. These type systems operate on Concurrent ML like languages. In [Tho93], B. Thomsen presented a sort and type system for a simple variant of Facile, where constructs for channel creation, sending, and receiving are functions of polymorphic types. The type and effect discipline together with all the extensions mentioned above demonstrated to be very efficient for ....

....above program under the Concurrent ML compiler, version 0.9.8, yields val it = fn: int unit. The resulting type states that the program returns a function value that takes an integer argument to the unit value ( Under the classical type and effect discipline [TJ92] as well as its extensions [BD93, NN94b, Tho93], the same program would be rejected since it involves an infinite effect. Actually, the associated type expression is int oe Gamma unit which stands for a function type that takes integers to the unit value, with oe as a latent communication effect, i.e. the effect oe would be generated when ....

B. Thomsen. Polymorphic sorts and types for concurrent functional programs. Technical Report ECRC-93-10, European Community Research Center, Munich, March 1993.

....polymorphism in calculus follows from the absence of a place where sort generalization may occur. Typing a la ML for concurrent languages is not new. Proposals have been defined for languages which combine functional and concurrent primitives (among the others, Concurrent ML [9] and Facile [10]) An analogous approach has recently been taken by Vasconcelos for an extension of calculus with agent names [12] In these languages channels are always monomorphic, and polymorphism is only allowed under functional abstractions. This enables to parameterize processes by arguments of different ....

B. Thomsen. Polymorphic sorts and types for concurrent functional programs. Technical Report ECRC-93-10, European Computer-Industry Research Center, Munich, Germany, 1993.

....polymorphism in calculus follows from the absence of a place where sort generalization may occur. Typing a la ML for concurrent languages is not new. Proposals have been de ned for languages which combine functional and concurrent primitives (among the others, Concurrent ML [9] and Facile [10]) An analogous approach has recently been taken by Vasconcelos for an extension of calculus with agent names [12] In these languages channels are always monomorphic, and polymorphism is only allowed under functional abstractions. This enables to parameterize processes by arguments of di erent ....

B. Thomsen. Polymorphic sorts and types for concurrent functional programs. Technical Report ECRC-93-10, European Computer-Industry Research Center, Munich, Germany, 1993.

No context found.

Bent Thomsen. Polymorphic Sorts and Types for Concurrent Functional Programs. 17. 06. 1993.

No context found.

Thomsen, B. Polymorphic Sorts and Types for Concurrent Functional Programs. In Proceedings of the 6th International Workshop on the Implementation of Functional Languages (Ed. J. Glauert), 1994. Also in Technical report ECRC-93-10, 1993.

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