Type inference for a distributed [pi]-calculus

@article{citeulike:1182146, abstract = {We study the type inference problem for a distributed [pi]-calculus with explicit notions of locality and migration. Location types involve names that may be bound in terms. This requires an accurate new approach. We define a notion of principal typing. We provide a formal description of a sound and complete type inference algorithm.}, author = {Lhoussaine, Cedric }, booktitle = {12th European Symposium on Programming (ESOP 2003)}, citeulike-article-id = {1182146}, doi = {http://dx.doi.org/10.1016/j.scico.2003.12.003}, journal = {Science of Computer Programming}, keywords = {calculus, formalism, theory}, month = {March}, number = {1-3}, pages = {225--251}, posted-at = {2007-03-23 23:41:52}, priority = {2}, title = {Type inference for a distributed [pi]-calculus}, url = {http://dx.doi.org/10.1016/j.scico.2003.12.003}, volume = {50}, year = {2004} }

TY - JOUR ID - citeulike:1182146 L3 - citeulike-article-id:1182146 N2 - We study the type inference problem for a distributed [pi]-calculus with explicit notions of locality and migration. Location types involve names that may be bound in terms. This requires an accurate new approach. We define a notion of principal typing. We provide a formal description of a sound and complete type inference algorithm. IS - 1-3 JF - Science of Computer Programming EP - 251 TI - Type inference for a distributed [pi]-calculus VL - 50 T2 - 12th European Symposium on Programming (ESOP 2003) SP - 225 KW - calculus KW - formalism KW - theory AU - Lhoussaine, Cedric PY - 2004/03// UR - http://dx.doi.org/10.1016/j.scico.2003.12.003 ER -