The Kell Calculus: Operational Semantics and Type System

  • Philippe Bidinger
  • Jean-Bernard Stefani
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2884)


This paper presents the Kell calculus, a new distributed process calculus that retains the original insights of the Seal calculus (local actions, process replication) and of the M-calculus (higher-order processes and programmable membranes), although in a much simpler setting than the latter. The calculus is equipped with a type system that enforces a unicity property for location names that is crucial for the efficient implementation of the calculus.


Type System Operational Semantic Type Scheme Reduction Rule Typing Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Amadio, R.: An asynchronous model of locality, failure, and process mobility. Technical report, INRIA Research Report RR-3109, INRIA Sophia-Antipolis, France (1997)Google Scholar
  2. 2.
    Berry, G., Boudol, G.: The chemical abstract machine. Theoretical Computer Science 96 (1992)Google Scholar
  3. 3.
    Bugliesi, M., Castagna, G., Crafa, S.: Boxed ambients. In: 4th International Symposium on Theoretical Aspects of Computer Software, TACS (2001)Google Scholar
  4. 4.
    Bugliesi, M., Crafa, S., Merro, M., Sassone, V.: Communication Interference in Mobile Boxed Ambients. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol. 2556, pp. 71–84. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  5. 5.
    Cardelli, L., Gordon, A.: Mobile ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, p. 140. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  6. 6.
    Castagna, G., Zappa, F.: The Seal Calculus Revisited. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol. 2556, pp. 85–96. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 7.
    Coppo, M., Dezani-Ciancaglini, M., Giovannetti, E., Salvo, I.: M3: Mobility types for mobile processes in mobile ambients. In: CATS 2003. ENTCS, vol. 78 (2003)Google Scholar
  8. 8.
    Ferrari, G., Moggi, E., Pugliese, R.: MetaKlaim: A Type-Safe Multi-Stage Language for Global Computing. In: Mathematical Structures in Computer Science (2003) (to appear)Google Scholar
  9. 9.
    Fournet, C., Levy, J.J., Schmitt, A.: An asynchronous distributed implementation of mobile ambients. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol. 1872, p. 348. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  10. 10.
    Hennessy, M., Riely, J.: Resource access control in systems of mobile agents. Technical report, Technical Report 2/98 – School of Cognitive and Computer Sciences, University of Sussex, UK (1998)Google Scholar
  11. 11.
    Levi, F., Sangiorgi, D.: Controlling interference in ambients. In: Proceedings 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2000 (2000)Google Scholar
  12. 12.
    Merro, M., Hennessy, M.: Bisimulation congruences in safe ambients. In: 29th ACM Symposium on Principles of Programming Languages (POPL), Portland, Oregon, January 16-18 (2002)Google Scholar
  13. 13.
    Sangiorgi, D., Valente, A.: A Distributed Abstract Machine for Safe Ambients. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, p. 408. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  14. 14.
    Schmitt, A., Stefani, J.B.: The M-calculus: A Higher-Order Distributed Process Calculus. In: Proceedings 30th Annual ACM Symposium on Principles of Programming Languages, POPL (2003)Google Scholar
  15. 15.
    Stefani, J.B.: A Calculus of Kells. In: Proceedings 2nd International Workshop on Foundations of Global Computing (2003)Google Scholar
  16. 16.
    Teller, D., Zimmer, P., Hirschkoff, D.: Using Ambients to Control Resources. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, p. 288. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  17. 17.
    Vitek, J., Castagna, G.: Towards a calculus of secure mobile computations. In: Bal, H.E., Cardelli, L., Belkhouche, B. (eds.) ICCL-WS 1998. LNCS, vol. 1686, p. 47. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  18. 18.
    Wojciechowski, P., Sewell, P.: Nomadic Pict: Language and Infrastructure. IEEE Concurrency 8(2) (2000)Google Scholar
  19. 19.
    Yoshida, N., Hennessy, M.: Assigning types to processes. In: 15th Annual IEEE Symposium on Logic in Computer Science, LICS (2000)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2003

Authors and Affiliations

  • Philippe Bidinger
    • 1
  • Jean-Bernard Stefani
    • 1
  1. 1.INRIA Rhône-AlpesSt IsmierFrance

Personalised recommendations