<XML><RECORDS><RECORD><REFERENCE_TYPE>10</REFERENCE_TYPE><REFNUM>6963</REFNUM><AUTHORS><AUTHOR>Hole,M.J.</AUTHOR><AUTHOR>Gay,S.J.</AUTHOR></AUTHORS><YEAR>2003</YEAR><TITLE>Bounded Polymorphism in Session Types</TITLE><PLACE_PUBLISHED>DCS Tech Report</PLACE_PUBLISHED><PUBLISHER>Dept of Computing Science, University of Glasgow</PUBLISHER><ISBN>TR-2003-132</ISBN><LABEL>Hole:2003:6963</LABEL><KEYWORDS><KEYWORD>Types</KEYWORD></KEYWORDS<ABSTRACT>We review work on session types and the pi-calculus, and give an example identifying a use for bounded polymorphic types in this setting. We then define a variant of the pi-calculus with the appropriate syntax, and propose a static bounded polymorphic type system, for which we prove type soundness. We use our rules to give a typing derivation and show the sequence of reductions in our example. Finally, we discuss related work and possible future work in this area.</ABSTRACT></RECORD></RECORDS></XML>