This paper presents a lter model for -calculus and shows its full abstraction with respect to a `may' operational semantics. The model is introduced in the form of a type assignment system. Types are related by a preorder that mimics the operational behaviour of terms. A subject expansion theorem holds. Terms are interpreted as lters of types: this interpretation is compositional. The proof of full abstraction relies on a notion of realizability of types and on the construction of terms, which test when an arbitrary term has a xed type.

A Filter Model for Mobile Processes

DAMIANI, Ferruccio;DEZANI, Mariangiola;
1999-01-01

Abstract

This paper presents a lter model for -calculus and shows its full abstraction with respect to a `may' operational semantics. The model is introduced in the form of a type assignment system. Types are related by a preorder that mimics the operational behaviour of terms. A subject expansion theorem holds. Terms are interpreted as lters of types: this interpretation is compositional. The proof of full abstraction relies on a notion of realizability of types and on the construction of terms, which test when an arbitrary term has a xed type.
9(1)
63
102
http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=44771
DAMIANI F.; M. DEZANI; GIANNINI P.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2318/24930
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? ND
social impact