A Calculus of Tagged Types , with applications to process languages

Tagged Types encode some families of types indexed by labels. Like Wand’s row types, they make use of specific variables from which new fields can be extracted, and like Rémy’s record types, the types introduced in these fields can be parameterized. However, the logical and technical treatment of tagged types is original; it is claimed that they combine the intuitiveness of row types with most of the expressiveness of record types. Their use is illustrated by the design of polymorphic typing systems for various process calculi extending CCS. Processes are assigned types which associate polymorphic types with all communication labels.

[1]  Robin Milner,et al.  A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[2]  X. Leroy.  Typage polymorphe d'un langage algorithmique , 1992 .

[3]  John H. Reppy,et al.  CML: A Higher-Order Concurrent Language , 1991, PLDI.

[4]  M. Tofte.  Operational Semantics and Polymorphic Type Inference , 1988 .

[5]  Didier Rémy.  Syntactic theories and the algebra of record terms , 1992 .

[6]  Thierry Le Sergent,et al.  Programming with Behaviors in an ML Framework - The Syntax and Semantics of LCS , 1994, ESOP.

[7]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[8]  Elena Zucca,et al.  Parametric Channels via Label Expressions in CCS , 1984, Theor. Comput. Sci..

[9]  Flemming Nielson,et al.  Higher-order concurrent programs with finite communication topology (extended abstract) , 1994, POPL '94.

[10]  Robin Milner,et al.  Principal type-schemes for functional programs , 1982, POPL '82.

[11]  Bent Thomsen,et al.  A calculus of higher order communicating systems , 1989, POPL '89.

[12]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[13]  Didier Rémy,et al.  Type checking records and variants in a natural extension of ML , 1989, POPL '89.

[14]  Mitchell Wand,et al.  Complete Type Inference for Simple Objects , 1987, LICS.

[15]  Bent Thomsen,et al.  Plain CHOCS A second generation calculus for higher order processes , 2005, Acta Informatica.

[16]  Kohei Honda,et al.  Principal Typing Schemes in a Polyadic pi-Calculus , 1993, CONCUR.

[17]  Mitchell Wand.  Type inference for objects with instance variables and inheritance , 1994 .

[18]  Prateek Mishra,et al.  Facile: A symmetric integration of concurrent and functional programming , 1989, International Journal of Parallel Programming.