Type and Behaviour Reconstruction for Higher-Order Concurrent Programs

Type and Behaviour Reconstruction for Higher-Order Concurrent Programs (1995)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Torben Amtoft , Flemming Nielson , Hanne Riis Nielson

Venue:	Journal of Functional Programming
Citations:	11 - 2 self

BibTeX

@ARTICLE{Amtoft95typeand,
    author = {Torben Amtoft and Flemming Nielson and Hanne Riis Nielson},
    title = {Type and Behaviour Reconstruction for Higher-Order Concurrent Programs},
    journal = {Journal of Functional Programming},
    year = {1995},
    volume = {7},
    pages = {347}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

: In this paper we develop a sound and complete type and behaviour inference algorithm for a fragment of CML (Standard ML with primitives for concurrency). Behaviours resemble terms of a process algebra and yield a concise presentation of the communications taking place during execution; types are mostly as usual except that function types and "delayed communication types" are labelled by behaviours expressing the communications that will eventually take place. The development of the present paper improves a previously published algorithm in not only achieving a sound algorithm for type inference but also one that is complete, due to an alternative strategy for generalising over types and behaviours. Although we show how to solve special kinds of constraints the problem of a general solution procedure for the constraints generated remains; this is related to an open problem concerning whether all programs typable in Standard ML (with concurrency primitives) are also typable in our syst...

Citations

No citations identified.