A typing system for a calculus of objects
The present paper introduces an implicitly typed object calculus intended to capture intrinsic aspects of concurrent objects communicating via asynchronous message passing, together with a typing system assigning typings to terms in the calculus. Types meant to describe the kind of messages an object may receive are assigned to the free names in a program, resulting in a scenario where a program is assigned multiple name-type pairs, constituting a typing for the process. Programs that comply to the typing discipline are shown not to suffer from runtime errors. Furthermore the calculus possesses a notion of principal typings, from which all typings that make a program well-typed can be extracted. We present an efficient algorithm to extract the principal typing of a process.
Unable to display preview. Download preview PDF.
- Kohei Honda. Types for Dyadic Interaction. In Proceedings of CONCUR'93, Springer-Verlag, LNCS, August 1993.Google Scholar
- Kohei Honda and Mario Tokoro. An Object Calculus for Asynchronous Communication. In 1991 European Conference on Object-Oriented Computing, pages 141–162, Springer-Verlag, 1991. LNCS 512.Google Scholar
- Robin Milner. The Polyadic π-Calculus: a Tutorial. ECS-LFCS 91-180, University of Edinburgh, October 1991.Google Scholar
- Atsushi Ohori. A compilation method for ML-style polymorphic record calculi. In 19th ACM Symposium on Principles of Programming Languages, pages 154–165, 1992.Google Scholar
- Vasco T. Vasconcelos. A predicative polymorphic type system for the polyadic π-calculus. May 1993. Keio University.Google Scholar
- Vasco T. Vasconcelos and Kohei Honda. Principal typing-schemes in a polyadic π-calculus. In Proceedings of CONCUR'93, Springer-Verlag, LNCS, August 1993.Google Scholar
- Mitchell Wand. A simple algorithm and proof for type inference. Fundamenta Informaticae, X:115–122, 1987. North-Holland.Google Scholar