Instant polymorphic type systems for mobile process calculi: Just add reduction rules and close

Lecture Notes in Computer Science

Volumn 3444, Issue , 2005, Pages 389-407

  Makholm, Henning ^a   Wells, J B ^a  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; MOBILE COMPUTING; SYNTACTICS;

MOBILE PROCESS CALCULI; POLYMORPHIC TYPE SYSTEMS; SHAPE CONSTRAINTS; SPATIAL POLYMORPHISM;

COMPUTATION THEORY;

EID: 24644495849     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31987-0_27     Document Type: Conference Paper

References (27)

1. M. Abadi, A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Inform. & Comput., 148(1), 1999.
2. T. Amtoft, H. Makholm, J. B. Wells. PolyA: True type polymorphism for Mobile Ambients. In IFIP TC1 3rd Int'l Conf. Theoret. Comput. Sci. (TCS '04). Kluwer Academic Publishers, 2004.
3. T. Amtoft, F. Turbak. Faithful translations between polyvariant flows and polymorphic types. In Programming Languages & Systems, 9th European Symp. Programming, vol. 1782 of LNCS. Springer-Verlag, 2000.
4. G. Boudol. The π-calculus in direct style. In Conf. Rec. POPL '97: 24th ACM Symp. Princ. of Prog. Langs., 1997.
5. M. Bugliesi, G. Castagna, S. Crafa. Boxed ambients. In 4th International Conference on Theoretical Aspects of Computer Science (TACS'01), vol. 2215 of LNCS. Springer-Verlag, 2001.
6. M. Bugliesi, S. Crafa, M. Merro, V. Sassone. Communication interference in mobile boxed ambients. In FST & TCS 2002, 2002.
7. L. Cardelli, G. Ghelli, A. D. Gordon. Mobility types for mobile ambients. In J. Wiedermann, P. van Emde Boas, M. Nielsen, eds., ICALP'99, vol. 1644 of LNCS. Springer-Verlag, 1999. Extended version appears as Microsoft Research Technical Report MSR-TR-99-32, 1999.
8. L. Cardelli, A. D. Gordon. Mobile ambients. In M. Nivat, ed., FoSSaCS'98, vol. 1378 of LNCS. Springer-Verlag, 1998.
9. L. Cardelli, P. Wegner. On understanding types, data abstraction, and polymorphism. Computing Surveys, 17(4), 1985.
10. G. Castagna, G. Ghelli, F. Z. Nardelli. Typing mobility in the Seal calculus. In K. G. Larsen, M. Nielsen, eds., CONCUR, vol. 2154 of LNCS. Springer-Verlag, 2001.
11. S. Chaki, S. K. Rajamani, J. Rehof. Types as models: Model checking message-passing programs. In Conf. Rec. POPL '02: 29th ACM Symp. Princ. of Prog. Langs., 2002.
12. M. Coppo, M. Dezani-Ciancaglini, E. Giovannetti, I. Salvo. M3: Mobility types for mobile processes in mobile ambients. In CATS 2003, vol. 78 of ENTCS, 2003.
13. A. D. Gordon, A. S. A. Jeffrey. Typing correspondence assertions for communication protocols. Theoret. Comput. Sci., 300(1-3), 2003.
14. A. Igarashi, N. Kobayashi. A generic type system for the pi-calculus. In Conf. Rec. POPL '01: 28th ACM Symp. Princ. of Prog. Langs., 2001.
15. F. Levi, C. Bodei. A control flow analysis for safe and boxed ambients. In Programming Languages & Systems, 13th European Symp. Programming, vol. 2986 of LNCS. Springer-Verlag, 2004.
16. F. Levi, D. Sangiorgi. Controlling interference in ambients. In POPL'00, Boston, Massachusetts. ACM Press, 2000.
17. H. Makholm, J. B. Wells. Instant polymorphic type systems for mobile process calculi: Just add reduction rules and close. Technical Report HW-MACS-TR-0022, Heriot-Watt Univ., School of Math. & Comput. Sci., 2004.
18. R. Milner, J. Parrow, D. Walker. A calculus of mobile processes. Inform. & Comput., 100(1), 1992.
19. H. R. Nielson, F. Nielson, H. Pilegaard. Spatial analysis of BioAmbients. In R. Giacobazzi, ed., Static Analysis: 11th Int'l Symp., vol. 3148 of LNCS, Verona, Italy, 2004. Springer-Verlag.
20. J. Palsberg, C. Pavlopoulou. From polyvariant flow information to intersection and union types. J. Funct. Programming, 11(3), 2001.
21. S. M. Pericas-Geertsen. XML-Fluent Mobile Ambients. PhD thesis, Boston University, 2001.
22. I. Phillips, M. G. Vigliotti. On reduction semantics for the push and pull ambient calculus. In Theoretical Computer Science: 2nd IFIP Int'l Conf., vol. 223 of IFIP Conference Proceedings. Kluwer, 2002.
23. G. Sander. Graph layout through the VCG tool. In R. Tamassia, I. G. Tollis, eds., Graph Drawing: DIMACS International Workshop, GD '94, vol. 894 of LNCS. Springer-Verlag, 1994.
24. D. N. Turner. The Polymorphic Pi-Calculus: Theory and Implementation. PhD thesis, University of Edinburgh, 1995. Report no ECS-LFCS-96-345.
25. J. Vitek, G. Castagna. Seal: A framework for secure mobile computations. In Internet Programming Languages, vol. 1686 of LNCS. Springer-Verlag, 1999.
26. J. B. Wells. The essence of principal typings. In Proc. 29th Int'l Coll. Automata, Languages, and Programming, vol. 2380 of LNCS. Springer-Verlag, 2002.
27. N. Yoshida. Graph types for monadic mobile processes. In Foundations of Software Technology and Theoret. Comput. Sci., 16th Conf., vol. 1180 of LNCS. Springer-Verlag, 1996.