Journal of Symbolic Computation
Algebraic reconstruction of types and effects
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type inference with recursive types: syntax and semantics
Information and Computation
CML: A higher concurrent language
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
ESOP'92 Symposium proceedings on 4th European symposium on programming
Type inference with polymorphic recursion
ACM Transactions on Programming Languages and Systems (TOPLAS)
Higher-order concurrent programs with finite communication topology (extended abstract)
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The type and effect discipline
Information and Computation
Programming with Behaviors in an ML Framework - The Syntax and Semantics of LCS
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Polymorphic Type Inference with Overloading and Subtyping
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Static and Dynamic Processor Allocation for Higher-Order Concurrent Languages
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
From CML to Process Algebras (Extended Abstract)
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Constraints for Polymorphic Behaviours of Concurrent ML
CCL '94 Proceedings of the First International Conference on Constraints in Computational Logics
Type-based race detection for Java
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Detecting race conditions in large programs
PASTE '01 Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Modular control-flow analysis with rank 2 intersection types
Mathematical Structures in Computer Science
Types for safe locking: Static race detection for Java
ACM Transactions on Programming Languages and Systems (TOPLAS)
Practical parameterised session types
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Static safety for an actor dedicated process calculus by abstract interpretation
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Hi-index | 0.00 |
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 representation of the communications taking place during execution; types are mostly as usual except that function ypes and ‘delayed communication types’ are labelled by behaviours expressing the communications that will take place if the function is applied or the delayed action is activated. The development of the present paper improves a previously published algorithm in achieving completeness as well as soundness; this is due to an alternative strategy for generalising over types and behaviours.