What Are Polymorphically-Typed Ambients?
Kfoury, Assaf J.
Pericas-Geertsen, Santiago M.
MetadataShow full item record
Citation (published version)Amtoft, Torben Amtoft; Kfoury, Assaf; Pericas-Geertsen, Santiago. "What are polymorphically-typed ambients?", Technical Report BUCS-2000-021, Computer Science Department, Boston University, October 19, 2000. [Available from: http://hdl.handle.net/2144/1814]
Abstract: The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code. We consider an Ambient Calculus where ambients transport and exchange programs rather that just inert data. We propose different senses in which such a calculus can be said to be polymorphically typed, and design accordingly a polymorphic type system for it. Our type system assigns types to embedded programs and what we call behaviors to processes; a denotational semantics of behaviors is then proposed, here called trace semantics, underlying much of the remaining analysis. We state and prove a Subject Reduction property for our polymorphically typed calculus. Based on techniques borrowed from finite automata theory, type-checking of fully type-annotated processes is shown to be decidable; the time complexity of our decision procedure is exponential (this is a worst-case in theory, arguably not encountered in practice). Our polymorphically-typed calculus is a conservative extension of the typed Ambient Calculus originally proposed by Cardelli and Gordon.