Dynamic type information in process types

  • Franz Puntigam
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1470)


Static checking of process types ensures that each object accepts all messages received from concurrent clients, although the set of acceptable messages can depend on the object’s state. However, conventional approaches of using dynamic type information (e.g., checked type casts) are not applicable in the current process type model, and the typing of self-references is too restrictive. In this paper a refinement of the model is proposed. It solves these problems so that it is easy to handle, for example, heterogeneous collections.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J.-L. Colaco, M. Pantel, and P. Sall’e. A set-constraint-based analysis of actors. In Proceedings FMOODS ’97, Canterbury, United Kingdom, July 1997. Chapman & Hall.Google Scholar
  2. 2.
    Simon J. Gay. A sort inference algorithm for the polyadic π-calculus. In Conference Record of the 20th Symposium on Principles of Programming Languages, January 1993.Google Scholar
  3. 3.
    Robin Milner. The polyadic π-calculus: A tutorial. Technical Report ECS-LFCS-91-180, Dept. of Comp. Sci., Edinburgh University, 1991.Google Scholar
  4. 4.
    R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes (parts I and II). Information and Computation, 100:1–77, 1992.MATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Oscar Nierstrasz. Regular types for active objects. ACM SIGPLAN Notices, 28(10):1–15, October 1993. Proceedings OOPSLA’93.CrossRefGoogle Scholar
  6. 6.
    Flemming Nielson and Hanne Riis Nielson. From CML to process algebras. In Proceedings CONCUR’93, number 715 in Lecture Notes in Computer Science, pages 493–508. Springer-Verlag, 1993.Google Scholar
  7. 7.
    E. Najm and A. Nimour. A calculus of object bindings. In Proceedings FMOODS ’97, Canterbury, United Kingdom, July 1997.Google Scholar
  8. 8.
    Benjamin Pierce and Davide Sangiorgi. Typing and subtyping for mobile processes. In Proceedings LICS’93, 1993.Google Scholar
  9. 9.
    Franz Puntigam. Flexible types for a concurrent model. In Proceedings of the Workshop on Object-Oriented Programming and Models of Concurrency, Torino, June 1995.Google Scholar
  10. 10.
    Franz Puntigam. Types for active objects based on trace semantics. In Elie Najm et al., editor, Proceedings FMOODS ’96, Paris, France, March 1996. IFIP WG 6.1, Chapman & Hall.Google Scholar
  11. 11.
    Franz Puntigam. Coordination requirements expressed in types for active objects. In Mehmet Aksit and Satoshi Matsuoka, editors, Proceedings ECOOP ’97, number 1241 in Lecture Notes in Computer Science, Jyväskylä, Finland, June 1997. Springer-Verlag.Google Scholar
  12. 12.
    António Ravara and Vasco T. Vasconcelos. Behavioural types for a calculus of concurrent objects. In Proceedings Euro-Par ’97, Lecture Notes in Computer Science. Springer-Verlag, 1997.Google Scholar
  13. 13.
    Vasco T. Vasconcelos. Typed concurrent objects. In Proceedings ECOOP’94, number 821 in Lecture Notes in Computer Science, pages 100–117. Springer-Verlag, 1994.Google Scholar
  14. 14.
    Vasco T. Vasconcelos and Kohei Honda. Principal typing schemes in a polyadic pi-calculus. In Proceedings CONCUR’93, July 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Franz Puntigam
    • 1
  1. 1.Institut für ComputersprachenTechnische Universität WienViennaAustria

Personalised recommendations