<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>5935</REFNUM><AUTHORS><AUTHOR>Gay,S.J.</AUTHOR></AUTHORS><YEAR>1993</YEAR><TITLE>A Sort Inference Algorithm for the Polyadic Pi-Calculus</TITLE><PLACE_PUBLISHED>Proceedings of the 20th ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages DOI: 10.1145/158511.158701</PLACE_PUBLISHED><PUBLISHER>ACM Press</PUBLISHER><LABEL>Gay:1993:5935</LABEL><KEYWORDS><KEYWORD>pi calculus</KEYWORD></KEYWORDS<ABSTRACT>In Milner's polyadic pi calculus there is a notion of "sorts" which is analogous to the notion of types in functional programming. As a well-typed program applies functions to arguments in a consistent way, a well-sorted process uses communication channels in a consistent way. An open problem is whether there is an algorithm to infer sorts in the pi calculus in the same way that types can be inferred in functional programming. Here we solve the problem by presenting an algorithm which infers the most general sorting for a process in the first-order calculus, and proving its correctness. The algorithm is similar in style to those used for Hindley-Milner type inference in functional languages.</ABSTRACT><URL>http://www.dcs.gla.ac.uk/~simon/publications/popl93.pdf</URL></RECORD></RECORDS></XML>