In this paper, we present recent work carried on μK, a core cal- culus that retains most of the features of K: explicit process distribution, remote operations, process mobility and asynchronous communication via dis- tributed tuple spaces. Communication in μK is based on a simple form of pattern matching that enables withdrawal from shared data spaces of matching tuples and binds the matched variables within the continuation process. Pattern matching is orthogonal to the underlying computational paradigm of μK, but affects its expressive power. After presenting the basic pattern matching mech- anism, inherited from K, we discuss a number of variants that are easy to implement and test, by means of simple examples, the expressive power of the resulting variants of the language.
Pattern Matching over a Dynamic Network of Tuple Spaces / De Nicola, R; Gorla, Daniele; Pugliese, R.. - STAMPA. - LNCS 3535:(2005), pp. 1-14. (Intervento presentato al convegno FMOODS 2005 tenutosi a Athens (Greece) nel June 15-17, 2005) [10.1007/11494881_1].
Pattern Matching over a Dynamic Network of Tuple Spaces
GORLA, DANIELE;
2005
Abstract
In this paper, we present recent work carried on μK, a core cal- culus that retains most of the features of K: explicit process distribution, remote operations, process mobility and asynchronous communication via dis- tributed tuple spaces. Communication in μK is based on a simple form of pattern matching that enables withdrawal from shared data spaces of matching tuples and binds the matched variables within the continuation process. Pattern matching is orthogonal to the underlying computational paradigm of μK, but affects its expressive power. After presenting the basic pattern matching mech- anism, inherited from K, we discuss a number of variants that are easy to implement and test, by means of simple examples, the expressive power of the resulting variants of the language.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.