Thesis Proposal: Type Theory for Mobility and Locality

In this thesis, we consider distributed programming from a type-theoretic, logical perspective. We develop a calculus for distributed programming based on a constructive modal logic. Through a Curry-Howard interpretation of proof terms as programs and propositions as types, we show that logical necessity is connected to mobility, and possibility to remote locality. We give an operational interpretation based on process configurations, where each process serves as an abstract location. We then show how to extend the calculus in various ways, raising the question of what a proper typetheoretic notion of immobility would be. Finally, we discuss issues that arise when one considers implementation of the calculus, both promising opportunities and practical