A Typing System for a Calculus of Objects (1993) [53 citations — 27 self]
Abstract:
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. 1
Citations
| 316 | The polyadic -calculus: a tutorial – Milner - 1991 |
| 282 | An object calculus for asynchronous communication – Honda, Tokoro - 1991 |
| 72 | A simple algorithm and proof for type inference – Wand - 1987 |
| 65 | A universal modular actor formalism for artificial intelligence – Hewitt, Bishop, et al. - 1973 |
| 62 | A compilation method for ML-style polymorphic record calculi – Ohori - 1992 |
| 43 | Types for dyadic interaction – Honda - 1993 |
| 11 | Predicative polymorphism in ��-calculus – Vasconcelos - 1994 |
| 11 | Principal typing-schemes in a polyadic -calculus – Vasconcelos, Honda - 1993 |

