Abstract
Process types specify sequences of acceptable messages. Even if the set of acceptable messages changes dynamically, a type checker can statically ensure that only acceptable messages are sent. As proposed so far, all message sequence sets specified by types can be generated by regular grammars. We propose to increase the expressiveness so that non-regular message sequence sets can be specified. Type equivalence and subtyping take possible type extensions into account.
Chapter PDF
References
R.M. Amadio and L. Cardelli. Subtyping recursive types. In Conference Record of the 18th Symposium on Principles of Programming Languages, pages 104–118. ACM, 1991.
H. Bowman, C. Briscoe-Smith, J. Derrick, and B. Strulo. On behavioural subtyping in LOTOS. In Proceedings FMOODS’ 97, Canterbury, United Kingdom, July 1997.
J.-L. Colaco, M. Pantel, and P. Salle. A set-constraint-based analysis of actors. In Proceedings FMOODS ’97, Canterbury, United Kingdom, July 1997. Chapman & Hall.
S.J. Gay. A sort inference algorithm for the polyadic π-calculus. In Conference Record of the 20th Symposium on Principles of Programming Languages, Jan. 1993.
J.E. Hopcroft and J.D. Ullman. Formal Languages and their Relation to Automata. Addison-Wesley, 1969.
B.H. Liskov and J.M. Wing. A behavioral notion of subtyping. ACM Transactions on Programming Languages and Systems, 16(6):1811–1841, Nov. 1994.
R. Milner. The polyadic π-calculus: A tutorial. Technical Report ECS-LFCS-91-180, Dept. of Comp. Sci., Edinburgh University, 1991.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes (parts I and II). Information and Computation, 100:1–77, 1992.
E. Najm and A. Nimour. A calculus of object bindings. In Proceedings FMOODS’ 97, Canterbury, United Kingdom, July 1997.
F. Nielson and H.R. Nielson. From CML to process algebras. In Proceedings CONCUR’93, number 715 in Lecture Notes in Computer Science, pages 493–508. Springer-Verlag, 1993.
O. Nierstrasz. Regular types for active objects. ACM SIGPLAN Notices, 28(10): 1–15, Oct. 1993. Proceedings OOPSLA’93.
B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. In Proceedings LICS’93, 1993.
F. Puntigam. Types for active objects based on trace semantics. In E.N. et al., editor, Proceedings FMOODS’ 96, Paris, France, Mar. 1996. IFIP WG 6.1, Chapman& Hall.
F. Puntigam. Coordination requirements expressed in types for active objects. In M. Aksit and S. Matsuoka, editors, Proceedings ECOOP’ 97, number 1241 in Lecture Notes in Computer Science, Jyväskylä, Finland, June 1997. Springer-Verlag.
F. Puntigam. Dynamic type information in process types. In D. Pritchard and J. Reeve, editors, Proceedings EuroPar’ 98, number 1470 in Lecture Notes in Computer Science, Southampton, England, Sept. 1998. Springer-Verlag.
F. Puntigam. Non-regular process types. Technical report, Institut für Computersprachen, Technische Universität Wien, Vienna, Austria, 1999.
A. Ravara and V.T. Vasconcelos. Behavioural types for a calculus of concurrent objects. In Proceedings Euro-Par’ 97, Lecture Notes in Computer Science. Springer-Verlag, 1997.
V.T. Vasconcelos. Typed concurrent objects. In Proceedings ECOOP’94, number 821 in Lecture Notes in Computer Science, pages 100–117. Springer-Verlag, 1994.
V.T. Vasconcelos and K. Honda. Principal typing schemes in a polyadic picalculus. In Proceedings CONCUR’93, July 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Puntigam, F. (1999). Non-regular Process Types. In: Amestoy, P., et al. Euro-Par’99 Parallel Processing. Euro-Par 1999. Lecture Notes in Computer Science, vol 1685. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48311-X_189
Download citation
DOI: https://doi.org/10.1007/3-540-48311-X_189
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66443-7
Online ISBN: 978-3-540-48311-3
eBook Packages: Springer Book Archive