T. Amtoft, F. Nielson, H.R. Nielson: Type and behaviour reconstruction for higher-order concurrent programs. To appear in Journal of Functional Programming, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Polymorphic Subtyping for Effect Analysis: the Static.. - Nielson, Nielson, Amtoft (1997) (5 citations) Self-citation (Amtoft Nielson) (Correct)
No context found.
T. Amtoft, F. Nielson, H.R. Nielson: Type and behaviour reconstruction for higher-order concurrent programs. To appear in Journal of Functional Programming, 1997.
Polymorphic Subtyping for Effect Analysis: the Static.. - Nielson, Nielson, Amtoft (1997) (5 citations) Self-citation (Amtoft Nielson) (Correct)
.... of [15] to let annotated type and e#ect systems extract terms of a process algebra from programs with communication; this involves polymorphism and sube#ecting but the algorithmic issues are non trivial [12] presumably because the inference system is expressed without using constraints) [1] presents an algorithm that is sound as well as complete, but which generates constraints that are not guaranteed to have best solutions. Finally we should mention [22] where e#ects are incorporated into ML types in order to deal with region inference. A step forward. In this paper we take an ....
T. Amtoft, F. Nielson, H.R. Nielson: Type and behaviour reconstruction for higher-order concurrent programs. To appear in Journal of Functional Programming, 1997.
Static and Dynamic Processor Allocation for Higher-Order.. - Nielson, Nielson (1995) (5 citations) Self-citation (Nielson) (Correct)
....follows [13] in developing a type and behaviour inference system for expressing the communication capabilities of programs in CML. This formulation takes full account of the polymorphism present in ML and algorithms for the automatic extraction of behaviours from CML programs are developed in [14, 1]. As was already indicated in [12] the behaviours may be regarded as terms in a process algebra (like CCS or CSP) however the process algebra of behaviours is specifically designed so as to capture those aspects of communication that are relevant for the efficient implementation of programs in ....
....is to transform the problem as specified by the syntax directed inference system into a syntax free equation solving problem where standard techniques from data flow analysis can be used to obtain fast implementations. As already mentioned the implementation of the first stage is the topic of [14, 1]. Comparison with other work. First we want to stress that our approach to processor allocation is that of static program analysis rather than, say, heuristics based on profiling as is often found in the literature on implementation of concurrent languages. In the literature there are only few ....
T.Amtoft, F.Nielson, H.R.Nielson: Type and behaviour reconstruction for higherorder concurrent programs. This proceedings.
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