Abstract
We present a type and behaviour reconstruction algorithm for Standard ML with concurrency. The behaviours express the communication effects during execution and resemble terms of a process algebra. The algorithm uses unification for the (essentially) free algebra of types and algebraic reconstruction for collecting constraints for the non-free algebra of behaviours. The algorithm and the statement and proof of soundness are designed so as to make no assumptions on the existence of “principal” be-haviours as these are unlikely to exist. The main complication is that the notion of expansiveness does not suffice for a sufficiently general treatment of the polymorphic let-construct.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
B. Berthomieu, T. Le Sergent: Programming with Behaviours in an ML Framework, the Syntax and Semantics of LCS. Proc. ESOP'94, SLNCS 788, 1994.
A. Giacalone, P. Mishra, S. Prasad: Operational and Algebraic Semantics for Facile: A Symmetric Integration of Concurrent and Functional Programming. Proc. ICALP'90, SLNCS 443, 1990.
T. Jensen: Disjunctive Strictness Analysis. Proc. LICS'92, 1992.
P. Jouvelot, D. K. Gifford: Algebraic Reconstruction of Types and Effects. Proc. POPL'90, 1990.
T.-M. Kuo, P. Mishra: Strictness Analysis: A New Perspective based on Type Inference. Proc. FPCA'89, ACM Press, 1989.
X. Leroy, P. Weiss: Polymorphic Type Inference and Assignment. Proc. POPL'90, ACM Press, 1990.
D. Matthews: A Distributed Concurrent Implementation of Standard ML. Proc. EurOpen Autumn 1991 Conference, 1991.
J. C. Mitchell: Type Inference with Simple Subtypes. Journal of Functional Programming 1, 1991.
F. Nielson, H.R. Nielson: From CML to Process Algebras. Proc. CONCUR'93, SLNCS 715, 1993.
H. R. Nielson, F. Nielson: Higher-Order Concurrent Programs with Finite Communication Topology. Proc. POPL'94, ACM Press, 1994.
J.H. Reppy: Higher-Order Concurrency. Ph.D.-Thesis, Rep. 92-1285, Department of Computer Science, Cornell University, 1992.
J.-P. Talpin, P. Jouvelot: The Type and Effect Discipline. Proc. LICS'92, 1992. (Also see Information and Computation 111 2, 1994.)
B. Thomsen: Polymorphic sorts and types for concurrent functional programs. Techn. Rep. ECRC-93-10, 1993.
J. H. Siekmann: Unification Theory. Journal of Symbolic Computation 7, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nielson, F., Nielson, H.R. (1994). Constraints for polymorphic behaviours of concurrent ML. In: Jouannaud, JP. (eds) Constraints in Computational Logics. CCL 1994. Lecture Notes in Computer Science, vol 845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016845
Download citation
DOI: https://doi.org/10.1007/BFb0016845
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58403-2
Online ISBN: 978-3-540-48699-2
eBook Packages: Springer Book Archive