Concurrent pattern calculus drives interaction between processes by unifying patterns, just as sequential pattern calculus drives computation by matching a pattern against a data structure. By generalising from pattern matching to unification, interaction becomes symmetrical, with information flowing in both directions. This provides a natural language for describing any form of exchange or trade. Many popular process calculi can be encoded in concurrent pattern calculus. © IFIP International Federation for Information Processing 2010.
Concurrent pattern calculus / Thomas Given, Wilson; Gorla, Daniele; Barry, Jay. - STAMPA. - 323 AICT:(2010), pp. 244-258. (Intervento presentato al convegno 6th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science, TCS 2010, Held as Part of 21st IFIP World Computer Congress, WCC 2010 tenutosi a Brisbane (Australia) nel 20 September 2010 through 23 September 2010) [10.1007/978-3-642-15240-5_18].
Concurrent pattern calculus
GORLA, DANIELE;
2010
Abstract
Concurrent pattern calculus drives interaction between processes by unifying patterns, just as sequential pattern calculus drives computation by matching a pattern against a data structure. By generalising from pattern matching to unification, interaction becomes symmetrical, with information flowing in both directions. This provides a natural language for describing any form of exchange or trade. Many popular process calculi can be encoded in concurrent pattern calculus. © IFIP International Federation for Information Processing 2010.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
