Type inference for a distributed π-calculus

Authors:
Cédric Lhoussaine
Affiliations:
University of Sussex, Brighton, UK
Venue:
ESOP'03 Proceedings of the 12th European conference on Programming
Year:
2003

Citing 9
Cited 2

The chemical abstract machine

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type inference with extended pattern matching and subtypes

Fundamenta Informaticae - Special issue: lambda calculus and type theory
Type inference for records in natural extension of ML

Theoretical aspects of object-oriented programming
Trust and partial typing in open systems of mobile agents

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On modelling mobility

Theoretical Computer Science
Simplifying subtyping constraints: a theory

Information and Computation
Resource access control in systems of mobile agents

Information and Computation
A Calculus of Mobile Agents

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Mobile Ambients

FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure

The receptive distributed π-calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
Confining data and processes in global computing applications

Science of Computer Programming - Special issue on security issues in coordination models, languages, and systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the type inference problem for a distributed π-calculus with explicit notions of locality and migration. Location types involve names that may be bound in terms. This requires some accurate new treatments. We define a notion of principal typing. We provide a formal description of sound and complete type inference algorithm.